Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
4th Edition
ISBN: 9780534380588
Author: Wayne L. Winston
Publisher: Brooks Cole
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 6.4, Problem 1P

Explanation of Solution

Stating the optimal solution:

  • The LINDO output is considered for the diet problem:
  • min z= 50BR+20IC+30CLA+80PC
  • Subject to constraint:
    • 400BR+200IC+150CLA+500PC500
    • 3BR+2IC6
    • 2BR+2IC+4CLA+4PC10
    • 2BR+4IC+CLA+5PC8
  • End
  • LP optimum is found at step 5
  • Objective function value: 90.000000
VariableValueReduced cost
BR0.00000027.500000
IC3.0000000.000000
CLA1.0000000.000000
PC0.00000050.000000
RowSlack or SurplusDual prices
2250.0000000.000000
30.000000-2.500000
40.000000-7.500000
55.0000000.000000
  • Number of iterations= 5
  • The ranges in which the basis is unchanged:
VariableCurrent coefficientOBJ coefficient ranges allowable increaseAllowable decrease
BR50

Blurred answer
Students have asked these similar questions
Suppose you want to pay back someone with 28 BDT and you have unlimited supply of 1 taka, 2 taka, 5 taka and 10 taka notes. Your target is to use the minimum number of notes to payback the said amount of money. How will you pay him/her back? That means how many notes of which value will you choose?
A hospital needs to purchase 3 gallons of perishable medicine for use during the current month and 4 gallons for use during the next month. Because the medicine is perishable, it can only be used during the month of purchase. Two companies (Daisy and Laroach) sell the medicine. The medicine is in short supply. Thus, during the next two months, the hospital is limited to buying at most 5 gallons from each company. The companies charge the prices shown in the table below. Formulate a balanced transportation model to minimize the cost of purchasing the needed medicine.
IKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…

Chapter 6 Solutions

Operations Research : Applications and Algorithms

Ch. 6.3 - Prob. 4PCh. 6.3 - Prob. 5PCh. 6.3 - Prob. 6PCh. 6.3 - Prob. 7PCh. 6.3 - Prob. 8PCh. 6.3 - Prob. 9PCh. 6.4 - Prob. 1PCh. 6.4 - Prob. 2PCh. 6.4 - Prob. 3PCh. 6.4 - Prob. 4PCh. 6.4 - Prob. 5PCh. 6.4 - Prob. 6PCh. 6.4 - Prob. 7PCh. 6.4 - Prob. 8PCh. 6.4 - Prob. 9PCh. 6.4 - Prob. 10PCh. 6.4 - Prob. 11PCh. 6.4 - Prob. 12PCh. 6.4 - Prob. 13PCh. 6.5 - Prob. 1PCh. 6.5 - Find the duals of the following LPs: Ch. 6.5 - Prob. 3PCh. 6.5 - Prob. 4PCh. 6.5 - Prob. 5PCh. 6.5 - Prob. 6PCh. 6.6 - Prob. 1PCh. 6.6 - Prob. 2PCh. 6.7 - Prob. 1PCh. 6.7 - Prob. 2PCh. 6.7 - Prob. 3PCh. 6.7 - Prob. 4PCh. 6.7 - Prob. 5PCh. 6.7 - Prob. 6PCh. 6.7 - Prob. 7PCh. 6.7 - Prob. 8PCh. 6.7 - Prob. 9PCh. 6.8 - Prob. 1PCh. 6.8 - Prob. 2PCh. 6.8 - Prob. 3PCh. 6.8 - Prob. 4PCh. 6.8 - Prob. 5PCh. 6.8 - Prob. 6PCh. 6.8 - Prob. 8PCh. 6.8 - Prob. 9PCh. 6.8 - Prob. 10PCh. 6.8 - Prob. 11PCh. 6.9 - Prob. 1PCh. 6.9 - Prob. 2PCh. 6.9 - Prob. 3PCh. 6.10 - Prob. 1PCh. 6.10 - Prob. 2PCh. 6.10 - Prob. 3PCh. 6.11 - Prob. 1PCh. 6.11 - Prob. 3PCh. 6.11 - Prob. 4PCh. 6.12 - Prob. 5PCh. 6.12 - Prob. 6PCh. 6.12 - Prob. 7PCh. 6 - Prob. 1RPCh. 6 - Prob. 2RPCh. 6 - Prob. 3RPCh. 6 - Prob. 4RPCh. 6 - Prob. 5RPCh. 6 - Prob. 6RPCh. 6 - Prob. 7RPCh. 6 - Prob. 8RPCh. 6 - Prob. 9RPCh. 6 - Prob. 10RPCh. 6 - Prob. 11RPCh. 6 - Prob. 13RPCh. 6 - Prob. 14RPCh. 6 - Prob. 15RPCh. 6 - Prob. 17RPCh. 6 - Prob. 18RPCh. 6 - Prob. 19RPCh. 6 - Prob. 20RPCh. 6 - Prob. 21RPCh. 6 - Prob. 22RPCh. 6 - Prob. 25RPCh. 6 - Prob. 29RPCh. 6 - Prob. 33RPCh. 6 - Prob. 34RPCh. 6 - Prob. 35RPCh. 6 - Prob. 36RPCh. 6 - Prob. 37RP
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole