1 / 26

SIE 340 Chapter 5. Sensitivity Analysis

QingPeng (QP) Zhang qpzhang@email.arizona.edu. SIE 340 Chapter 5. Sensitivity Analysis. 5.1 A Graphical Introduction to Sensitivity Analysis. Sensitivity analysis is concerned with how changes in an linear programming’s parameters affect the optimal solution . Example: Giapetto problem.

mandy
Download Presentation

SIE 340 Chapter 5. Sensitivity Analysis

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. QingPeng (QP) Zhang qpzhang@email.arizona.edu SIE 340Chapter 5. Sensitivity Analysis

  2. 5.1 A Graphical Introduction to Sensitivity Analysis • Sensitivity analysis is concerned with how changes in an linear programming’s parameters affect the optimal solution.

  3. Example: Giapetto problem Weekly profit (revenue - costs) = number of soldiers produced each week = number of trains produced each week. Profit generated by each soldier $3 Profit generated by each train $2

  4. Example: Giapetto problem • (weekly profit) s.t. (finishing constraint) (carpentry constraint) (demand constraint) (sign restriction) = number of soldiers produced each week = number of trains produced each week.

  5. Example: Giapetto problem Optimal solution =(60, 180) =180 Basic variable Basic solution

  6. Changes of Parameters • Change objective function coefficient • Change right-hand side of constraint • Other change options • Shadow price • The Importance of sensitivity analysis

  7. Change Objective Function Coefficient • How would changes in the problem’s objective function coefficients or the constraint’s right-hand sides change this optimal solution?

  8. Change Objective Function Coefficient ? ?

  9. Change Objective Function Coefficient If then Slope is steeper B->C

  10. Change Objective Function Coefficient Slope is steeper New optimal solution: (40, 20)

  11. Change Objective Function Coefficient If then Slope is flatter B->A

  12. Change Objective Function Coefficient Slope is steeper New optimal solution: (0, 80) z=

  13. Changes of Parameters • Change objective function coefficient • Change right-hand side of constraint • Other change options • Shadow price • The Importance of sensitivity analysis

  14. Change RHS • (weekly profit) s.t. (finishing constraint) (carpentry constraint) (demand constraint) (sign restriction) = number of soldiers produced each week = number of trains produced each week.

  15. Change RHS • is the number of finishing hours. • Change in b1 shifts the finishing constraint parallel to its current position. • Current optimal point (B) is where the carpentry and finishing constraints are binding.

  16. Change RHS • As long as the binding point (B) of finishing and carpentry constraints is feasible, optimal solution will occur at the binding point.

  17. Change RHS (demand constraint) (sign restriction) • If >120, >40 at the binding point. • If <80, <0 at the binding point. • So, in order to keep the basic solution, we need: (z is changed)

  18. Changes of Parameters • Change objective function coefficient • Change right-hand side of constraint • Other change options • Shadow price • The Importance of sensitivity analysis

  19. Other change options • (weekly profit) s.t. (finishing constraint) (carpentry constraint) (demand constraint) (sign restriction)

  20. Other change options • (weekly profit) s.t. (finishing constraint) (carpentry constraint) (demand constraint) (sign restriction)

  21. Changes of Parameters • Change objective function coefficient • Change right-hand side of constraint • Other change options • Shadow price • The Importance of sensitivity analysis

  22. Shadow Prices • To determine how a constraint’s rhs changes the optimal z-value. • The shadow price for the ith constraint of an LP is the amount by which the optimal z-value is improved (increased in a max problem or decreased in a min problem).

  23. Shadow Prices – Example • Finishing constraint • Basic variable: 100 • Current value • 100+Δ • New optimal solution • (20+Δ, 60-Δ) • z=3+2=180+Δ • Current basis is optimal one increase in finishing hours increase optimal z-value by $1 The shadow price for the finishing constraint is $1

  24. Changes of Parameters • Change objective function coefficient • Change right-hand side of constraint • Other change options • Shadow price • The Importance of sensitivity analysis

  25. The Importance of Sensitivity Analysis • If LP parameters change, whether we have to solve the problem again? • In previous example: sensitivity analysis shows it is unnecessary as long as: • z is changed

  26. The Importance of Sensitivity Analysis • Deal with the uncertainty about LP parameters • Example: • The weekly demand for soldiers is 40. • Optimal solution B • If the weekly demand is uncertain. • As long as the demand is at least 20, B is still the optimal solution.

More Related