Sensitivity of the Right Hand Side Coefficients

Slides:



Advertisements
Similar presentations
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200.
Advertisements

$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500.
Agenda of Week VII. LP V LP Application 2 Time assignment Beggar family LINGO illustration Understanding LP LP interpretation Week 6 1 LP Sensitivity Analysis.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Demonstration Problem
February 26, 2002 Sensitivity Analysis presented as FAQs – Points illustrated on a running example of glass manufacturing. – If time permits, we.
Copyright © Cengage Learning. All rights reserved.
QingPeng (QP) Zhang  Sensitivity analysis is concerned with how changes in an linear programming’s parameters affect the optimal.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
$100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300 $400 $500 $100 $200 $300.
Equal or Not. Equal or Not
Slippery Slope
LINEAR PROGRAMMING (LP)
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Understanding optimum solution
Linear Programming.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
Sensitivity Analysis Sensitivity analysis examines how the optimal solution will be impacted by changes in the model coefficients due to uncertainty, error.
Linear Programming Sensitivity of the Right Hand Side Coefficients.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
SENSITIVITY ANALYSIS.
Linear and Integer Programming Models
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Lecture 11: Sensitivity Part II: Prices AGEC 352 Spring 2011 – March 2 R. Keeney.
Sensitivity analysis BSAD 30 Dave Novak
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
Linear Programming Building Good Linear Models And Example 1 Sensitivity Analyses, Unit Conversion, Summation Variables.
Chapter 4: Linear Programming Sensitivity Analysis
1 Linear Programming Using the software that comes with the book.
Sensitivity of the Objective Function Coefficients
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Linear Programming.
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
Linear Programming Sensitivity of the Objective Function Coefficients.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
Readings Readings Chapter 3
Linear and Integer Programming Models 1 Chapter 2.
Managerial Decision Making and Problem Solving
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 Linear and Integer Programming Models Chapter 2.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Linear Programming: Sensitivity Analysis and Interpretation of Solution Pertemuan 5 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
CDAE Class 17 Oct. 23 Last class: Result of Quiz 4 3. Linear programming and applications Today: 3. Linear programming and applications Review for.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
1 1 Slide © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
CDAE Class 16 Oct. 18 Last class: 3. Linear programming and applications Quiz 4 Today: Result of Quiz 4 3. Linear programming and applications Group.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
Linear Programming Chapter 14 Supplement Lecture Outline Model Formulation Graphical Solution Method Linear Programming Model Solution Solving Linear.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Practice: Given the following Sensitivity Analysis Report
St. Edward’s University
Graphical Analysis – the Feasible Region
Duality Theory and Sensitivity Analysis
Sensitivity.
Section 3.4 Sensitivity Analysis.
Presentation transcript:

Sensitivity of the Right Hand Side Coefficients Linear Programming Sensitivity of the Right Hand Side Coefficients

Sensitivity of RHS Coefficients RHS coefficients usually give some maximum limit for a resource or some minimum requirement that must be met. Changes to the RHS can happen when extra units of the resource become available or when some of the original resource becomes unavailable. Or the minimum requirement is loosened (made less) or strengthened (made greater). Extra units may be available for a price. The question becomes how much would an extra unit add to the value of the objective function, that is, “what is the most we would be willing to pay for extra units of the resource?”

Finding the Optimal Point - Review X2 1000 900 800 700 600 500 400 300 200 100 X1 Max 8X1 + 5X2 s.t. OPTIMAL POINT (320,360) = 4360 2X1 + 1X2 ≤ 1000 (Plastic) 3X1 + 4X2 ≤ 2400 (Time) 1X1 + 1X2 ≤ 700 (Limit) 1X1 - 1X2 ≤ 350 (Mix) X1, X2 ≥ 0

Optimal Point With One Extra Unit of Plastic 1000 900 800 700 600 500 400 300 200 100 X1 Shadow Price (for Plastic) 4363.40 – 4360 = (new profit) - (old profit) $3.40 Max 8X1 + 5X2 s.t. New OPTIMAL POINT (320.8,359.4) = 4363.40 1001 2X1 + 1X2 ≤ 1000 (Plastic) 3X1 + 4X2 ≤ 2400 (Time) 1X1 + 1X2 ≤ 700 (Limit) 1X1 - 1X2 ≤ 350 (Mix) X1, X2 ≥ 0 Still determined by Plastic and Time constraints

Shadow Prices The shadow price for a constraint is the amount the objective function value will change given: 1 additional unit on the RHS of the constraint No other changes This shadow price is valid as long as the same constraints (including the one whose RHS is changing) determine the optimal point. In this case plastic and production time It can be shown that if the RHS for plastic were 1002 the profit would increase another $3.40 to $4366.80. It can also be shown that if the RHS for plastic were 999 the profit would decrease by $3.40 to $4356.60.

Allowable Increase and Allowable Decrease of a RHS Value The shadow prices remain valid as long as the same constraints (called the binding constraints) determine the optimal point. When the RHS of the constraint is increased or decreased to the point that another constraint replaces one of the binding constraints to determine the optimal point a new shadow price becomes valid for the constraint. The amount the RHS can increase or decrease before another constraint becomes one of the binding constraints is what Excel calls the Allowable Increase and the Allowable Decrease respectively.

Increasing the Right Handside for Plastic X2 1000 900 800 700 600 500 400 300 200 100 X1 Max 8X1 + 5X2 s.t. 1030 1060 1100 2X1 + 1X2 ≤ 1000 (Plastic) 3X1 + 4X2 ≤ 2400 (Time) 1X1 + 1X2 ≤ 700 (Limit) 1X1 - 1X2 ≤ 350 (Mix) X1, X2 ≥ 0 Plastic and Time constraints still determine the optimal solution to this point.

Further Increasing the Right Hand Side for Plastic X2 1000 900 800 700 600 500 400 300 200 100 X1 Max 8X1 + 5X2 s.t. 1030 1060 1100 1102 2X1 + 1X2 ≤ 1000 (Plastic) 3X1 + 4X2 ≤ 2400 (Time) 1X1 + 1X2 ≤ 700 (Limit) 1X1 - 1X2 ≤ 350 (Mix) X1, X2 ≥ 0 Further increases to the RHS side of plastic have now made the plastic and the Limit constraints as the ones that determine the optimal point. The shadow prices will now CHANGE

Decreasing the RHS for Plastic X2 1000 900 800 700 600 500 400 300 200 100 X1 Max 8X1 + 5X2 s.t. 600 700 850 1000 2X1 + 1X2 ≤ (Plastic) 3X1 + 4X2 ≤ 2400 (Time) 1X1 + 1X2 ≤ 700 (Limit) Redundant 1X1 - 1X2 ≤ 350 (Mix) X1, X2 ≥ 0 Optimal solution determined by Plastic and Time Constraints and by X2 axis!

Further Decreasing the RHS for Plastic X2 1000 900 800 700 600 500 400 300 200 100 X1 Max 8X1 + 5X2 s.t. 590 600 700 850 1000 2X1 + 1X2 ≤ (Plastic) 3X1 + 4X2 ≤ 2400 (Time) 1X1 + 1X2 ≤ 700 (Limit) Redundant 1X1 - 1X2 ≤ 350 (Mix) X1, X2 ≥ 0 Optimal Point now determined by the plastic constraint and the X2-axis The shadow prices will now CHANGE

Comparison With Excel Here is the printout out of the sensitivity analysis dealing with the objective RHS coefficients for the original Galaxy Industries problem. Shadow Price for each constraint Range of Feasibility for RHS1 1000 – 400  1000 + 100 600  1100 Range of Feasibility for RHS2 2400 - 650  2400 + 100 1750  2500 Range of Feasibility for RHS3 700 – 20  700 + ∞ 680  ∞ Range of Feasibility for RHS4 350 – 390  350 + ∞ - 40  ∞ Range of Feasibility is the range of values that an RHS coefficient can assume without changing the shadow prices as long as no other changes are made.

Exact Meaning of Shadow Prices A shadow price always means the amount the objective function will change given a one unit increase in the RHS value of a constraint. But does this mean that this is the value (the most you would be willing to pay) for an extra unit? The answer depends on how the objective function coefficients were calculated. If the objective function coefficients did not take the value of the resource into consideration, these are sunk costs. Shadow price = the value of an extra unit of the resource. If the objective function coefficients did take the value of the resource into consideration, these are included costs. Shadow price = a premium above the current price of the item that one would be willing to pay for an extra unit.

Plastic is an included cost EXAMPLE Suppose the $8 objective function coefficient for dozens of Space Rays and the $5 objective function coefficient for dozens of Zappers were calculated as follows: DOZ. DOZ. SPACE RAYS ZAPPERS Selling Price $24 $26 Costs Plastic ($3/lb) $ 6 (2 lbs.) $ 3 (1 lb.) Other Variable Costs $10 $18 =========== ========== Total Profit Per Dozen $ 8 $ 5 Plastic is an included cost Production time is a sunk cost The $3.40 shadow price for plastic means we would be willing to pay up to $3.40 more than the current price of $3 per pound (that is up to $6.40/ lb.) for extra plastic. It is not included in the objective function coefficient calculation. The $0.40 shadow price is the value of an extra minute of production time.

Complementary Slackness Complementary slackness also holds for RHS values. This property for RHS values states: Again, it can happen, that both are 0. Complementary Slackness For RHS Coefficients For each constraint, either the slack (difference between RHS – LHS) is 0 or its shadow price will be 0. Plastic: Shadow Price ≠ 0; Slack = 1000-1000 = 0 Time: Shadow Price ≠ 0; Slack = 2400-2400 = 0 Prod. Limit: Slack = 700-680 ≠ 0; Shadow Price = 0 Prod. Mix: Slack = 350-(-40) ≠ 0; Shadow Price = 0

Review Shadow price Range of Feasibility Complementary Slackness Found by subtracting the original objective function value from the objective function value with one more unit of the resource on the RHS Meaning Included Cost Sunk Cost Range of Feasibility Range of RHS value in which shadow price does not change The same constraints determine the optimal solution in the range of feasibility Complementary Slackness Either the slack is 0 or the shadow price is 0