{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Linear Programming -- Objective Sensitivity

For x 2 final value 0 but reduced cost 0 final

Info iconThis preview shows pages 11–14. Sign up to view the full content.

View Full Document Right Arrow Icon
For X 2 , Final Value ≠ 0, but Reduced Cost = 0. Final Reduced Objective Allowable Allowable Cell Name Value Cost Coefficient Increase Decrease $B$4 Dozen Space Rays - (2.75) 1 2.75 1E+30 $C$4 Dozen Zappers 600 - 5 1E+30 3.666666667
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Complementary Slackness Complementary Slackness MAX 8X MAX 8X 1 1 + 5X + 5X 2 2 For Space Rays, Final Value > 0, but Reduced Cost = 0. For Zappers, Final Value > 0, but Reduced Cost = 0. Sensitivity report for the problem
Background image of page 12
Complementary Slackness Complementary Slackness An important concept in linear programming is that of complementary slackness. It states: It can happen, that both are 0. Complementary Slackness For Objective Function Coefficients For each variable, either its value or its reduced cost will be 0.
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Review Review Reasons for Sensitivity Analyses Approximations Dynamic Changes What-If Range of Optimality for Objective Function Coefficients Excel Reduced Cost – Two Meanings/Calculations How much an objective coefficient must change before the variable can be positive. Change to profit for a 1-unit increase in a variable whose optimal value is 0. Complementary Slackness
Background image of page 14
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}