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 7P

Explanation of Solution

Optimal solution of the diet problem:

  • The LINDO output is considered for the Dakota problem:
  • max 60DSK+30TBLS+20CHRS
  • Subject to constraint
    • 8DSK+6TBLS+CHRS48
    • 4DSK+2TBLS+1.5CHRS20
    • 2DSK+1.5TBLS+0.5CHRS8
  • End
  • LP optimum is found at step 2
  • Objective function value: 90.000000
VariableValueReduced cost
DSK2.0000000.000000
TBLS0.0000005.000000
CHRS8.0000000.000000
RowSlack or SurplusDual prices
224.0000000.000000
30.00000010.000000
40.00000010.000000
  • Number of iterations= 2
  • The ranges in which the basis is unchanged:
VariableCurrent coefficientOBJ coefficient ranges allowable increaseAllowable decrease
DSK60.00000020.0000004.000000
TBLS30.0000005.000000Infinity
CHRS20.0000002.5000005.000000
RowCurrent RHSRight-hand side ranges allowable increaseAllowable decrease
248.000000Infinity24.000000
320.0000004.0000004.000000
48.0000002.0000001.333333
  • As brownies and pineapple cheesecake have no zero reduced costs, so case 2 is applied to the states where,
    • “At least one variable whose objective function coefficient is changed has a reduced cost of zero”.
  • In case 2 for each variable xj the ratio rj is defined as follows:
    • If Δcj0, then rj=ΔcjIj
    • If Δcj0, then rj=ΔcjDj
  • Here,
    • Δcj= Change in original objective function coefficient (cj) for xj
    • Ij= Maximum allowable increase in cj from LINDO output.
    • Dj= Maximum allowable decrease in cj from LINDO output.
  • The 100% rule for objective function states that,
    • “If rj1, then the current basis remains optimal”
    • Also,
    • “If rj>1, then the current basis may or may not be optimal”.
  • If the current basis remains optimal, the value of the decision variables remains unchanged, but the optimal z-value may change.
  • Now, the price of desk is increased to $65, the price of the table is decreased to $25 and the price of chair is decreased to $18

Blurred answer
Students have asked these similar questions
Isn't the actual optimal S->B->G. If yes, then how are the assumed heuristics valid?
Suppose the risk index for the stock fund (the value of ) increases from its current value of 8 to 12. How does the optimal solution change, if at all? Suppose the risk index for the money market fund (the value of ) increases from its current value of 3 to 3.5. How does the optimal solution change, if at all? Suppose increases to 12 and increases to 3.5. How does the optimal solution change, if at all?
A pig weighting 200 pounds gains 5 pounds per day and costs 45 cents aday to keep. The market price for pigs is 65 cents per pound, but is falling 1 cent perday.a/ When should the pig be sold? What is the optimal profit?b/ What are the sensitivities of the optimal time and optimal profit with respect to the45-cent upcost?c/ What are the sensitivities of the optimal time and optimal profit with respect to the1-cent market depreciation?

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
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole