Sensitivity Analysis What if there is uncertainly about one or more values in the LP model? 1. Raw material changes, 2. Product demand changes, 3. Stock.

Slides:



Advertisements
Similar presentations
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Advertisements

Understanding optimum solution
Chapter 5 Sensitivity Analysis: An Applied Approach
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc. 1 Chapter 5 Sensitivity Analysis: An Applied Approach to accompany Introduction to.
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.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
SENSITIVITY ANALYSIS.
LP EXAMPLES.
Managerial Decision Modeling with Spreadsheets
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Sensitivity analysis BSAD 30 Dave Novak
Chapter 4: Linear Programming Sensitivity Analysis
1 Linear Programming Using the software that comes with the book.
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Spreadsheet Modeling & Decision Analysis:
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
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.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
Special Conditions in LP Models (sambungan BAB 1)
Readings Readings Chapter 3
Presentation: H. Sarper
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
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.
Managerial Decision Making and Problem Solving
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor.
Managerial Decision Modeling with Spreadsheets Chapter 4 Linear Programming Sensitivity Analysis.
Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor Case Study (Section 5.2)5.2 Changes in One Objective Function.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
5-1 Wyndor (Before What-If Analysis). 5-2 Using the Spreadsheet to do Sensitivity Analysis The profit per door has been revised from $300 to $200. No.
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.
Sensitivity Analysis Consider the CrossChek hockey stick production problem:   Management believes that CrossChek might only receive $120 profit from the.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Sensitivity Analysis Consider the CrossChek hockey stick production problem: Management believes that CrossChek might only receive $120 profit from the.
Sensitivity analysis LI Xiao-lei. A graphical introduction to sensitivity analysis Sensitivity analysis is concerned with how changes in an LP’s parameters.
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.
Linear Programming Models: Graphical and Computer Methods
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
Lecture 6 Linear Programming Sensitivity Analysis
© 2008 Prentice-Hall, Inc. Linear Programming Models: Graphical and Computer Methods.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Sensitivity Analysis Introduction to Sensitivity Analysis
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
P RIMAL -D UAL LPP. T HE R EDDY M IKKS C OMPANY - PROBLEM Reddy Mikks company produces both interior and exterior paints from two raw materials, M 1 and.
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.
Managerial Decision Modeling with Spreadsheets Chapter 4 Linear Programming Sensitivity Analysis.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
St. Edward’s University
Chapter 5 Sensitivity Analysis: An Applied Approach
Presentation transcript:

Sensitivity Analysis What if there is uncertainly about one or more values in the LP model? 1. Raw material changes, 2. Product demand changes, 3. Stock price Sensitivity analysis allows a manager to ask certain hypothetical questions about the problem, such as: How much more profit could be earned if 10 more hours of labour were available? Which of the coefficient in model is more critical?

Sensitivity analysis allows us to determine how “sensitive” the optimal solution is to changes in data values. This includes analyzing changes in: 1. An Objective Function Coefficient (OFC) 2. A Right Hand Side (RHS) value of a constraint

 Max Ax + BY  Keeping x, Y same how the object function behaves if A, B are changed.  The optimal solution will remain unchanged as long as An objective function coefficient lies within its range of optimality  If the OFC changes beyond that range a new corner point becomes optimal.

 Generally, the limits of a range of optimality are found by changing the slope of the objective function line within the limits of the slopes of the binding constraint lines.  Binding constraint  Are the constraints that restrict the feasible region

We can use the graph of an LP to see what happens when: 1. An OFC changes, or 2. A RHS changes Recall the Flair Furniture problem

2x 1 + 3x 2 < 19 x 1 + x 2 < 8 Max 5x 1 + 7x 2 x 1 < 6 Optimal solution: x 1 = 5, x 2 = 3 x 1 = 5, x 2 = 3 Example 1: Max 5x 1 + 7x 2 s.t. x 1 6 2x 1 + 3x 2 < 19 2x 1 + 3x 2 < 19 x 1 + x 2 < 8 x 1 + x 2 < 8 x 1 > 0 and x 2 > 0 x 1 > 0 and x 2 > 0 Feasibleregion Sensitivity to Coefficients Graphical solution of Example 1

Compute the range of optimality for c 1 in Example 1. Compute the range of optimality for c 1 in Example 1. n The slope of an objective function line, Max c 1 x 1 + c 2 x 2, is - c 1 /c 2. n The slope of the binding third constraint, x 1 + x 2 = 8, is -1. T he slope of the binding second constraint, 2x 1 + 3x 2 = 19, is -2/3. T he slope of the binding second constraint, 2x 1 + 3x 2 = 19, is -2/3. n Find the range of values for c 1 (with c 2 staying 7) such that the objective-function line slope lies between that of the two binding constraints: -1 < -c 1 /7 < -2/3 -1 < -c 1 /7 < -2/3 Multiplying by -1, 1 > c 1 /7 > 2/3 Multiplying by -1, 1 > c 1 /7 > 2/3 Multiplying by 7, 7 > c 1 > 14/3 Multiplying by 7, 7 > c 1 > 14/3 Sensitivity to Coefficients Range of optimality for c 1 Example 1: Max 5x 1 + 7x 2 s.t. x 1 < 6 2x 1 + 3x 2 < 19 2x 1 + 3x 2 < 19 x 1 + x 2 < 8 x 1 + x 2 < 8 x 1 > 0 and x 2 > 0 x 1 > 0 and x 2 > 0

Sensitivity to Coefficients Range of optimality for c 2 Example 1: Max 5x 1 + 7x 2 s.t. x 1 < 6 2x 1 + 3x 2 < 19 2x 1 + 3x 2 < 19 x 1 + x 2 < 8 x 1 + x 2 < 8 x 1 > 0 and x 2 > 0 x 1 > 0 and x 2 > 0 Likewise, compute the range of optimality for c 2 in Example 1. Likewise, compute the range of optimality for c 2 in Example 1. n The slope of the binding third constraint is -1. T he slope of the binding second constraint is -2/3. T he slope of the binding second constraint is -2/3. n Find the range of values for c 2 (with c 1 staying 5) such that the objective-function line slope lies between that of the two binding constraints: -1 < -5/c 2 < -2/3 -1 < -5/c 2 < -2/3 Multiplying by -1, 1 > 5/c 2 > 2/3 Inverting, 1 < c 2 /5 < 3/2, Multiplying by 5 5 < c 2 < 15/2 Example 1: Max 5x 1 + 7x 2 s.t. x 1 < 6 2x 1 + 3x 2 < 19 2x 1 + 3x 2 < 19 x 1 + x 2 < 8 x 1 + x 2 < 8 x 1 > 0 and x 2 > 0 x 1 > 0 and x 2 > 0

Optimal solution: S=540,D=252 S=540,D=252 Max 7S + 9D 7/10S+1D<=630 (Cutting & dyeing) 1/2S+5/6D <=600 Sewing 1S+2/3D<=708 Finishing 1/10S+1/4D<=135 Inspection & Packaging Sensitivity to Coefficients Graphical solution of Example 1 1. objective function 2. Cutting Line 3.Finishing Line This point will be an optimal solution as long as: slope of line A <=slope of the objective function <= slope of line A i.e. the slope of the objective function should be in between these two lines

 7/10S+D=630 (C&D)  D=-7/10S+630  S+2/3D=708 (Finishing)  D=-3/2S+1062  -3/2<=slope of objective function <=-7/10  -3/2<=-Cs/Cd<=-7/10  if we put profit contribution of delux bag same i.e 9  -3/2<=-Cs/9<=-7/10  Cs>=3*9/2  Cs>=27/2  Cs>=13.5  Cs>=63/10  Cs>=6.3  6.3 <=Cs<=13.5 (limits for Cs with same optimal solution)

 Similarly the keeping profit contribution of S bag constant. Cs=10  6.67<=Cd<=14.29 (range of optimality)  If both the Cs, Cd are changed simultaneously (i.e S bags to 13, D bags to 8)  Calculate the slope again:  -cs/cd =-13/8=  -3/2<=-Cs/Cs<=-7/10  now -Cs/Cd= which is less than -3/2 which is not acceptable according to above equation hence this means if we change the both cofficient than 540 and 252 would not be the optimal solution.

 suppose if additional 10 hrs is added to cutting and dyeing constraint  7/10S+1d<=640 ???  Feasible region extended, find extreme point using intersection of two lines  S=527.5,D= Max 10S+9D  Profit= which is =43.75  Increase in profit/hr =

 It is the improvement in the optimal solution per unit increase in the RHS of contraint .if dual price is negative this means value of objective function will not improved rather it would get worse,if value at rhs of the constrain is increased by 1 unit. for minimization problem it means cost will increase by 10.

 For all the objective functions that are changed the sum of percentages of allowable increase and allowable decrease if does not exceed by 100% then optimal solution will not change. However this does not means that if sum of the percentage is exceed by 100% then optimal solution will change, in that case the problem must be resolved. This rule is equally applicable on the constraints RHS.

 S is changed from 10$ to 11.50$;  D is reduced from $9 to $8.25  Range of optimality from the sensitivity analysis :  allowable upper limit for S= 13.49;  Value of S =$10  Allowable increase in S= =3.49  for the present case D is reduced from $9 to $8.25  the increase in percentage is 1.5*100/3.49=42.86% of allowable increase

 For D  allowable lower limit is 6.66  Value of D=9  allowable Decrease =9-6.66=2.33  for present case =0.75/2.33*100= of allowable decrease.  sum of allowable increase and decrease is 42.86% % <100% hence optimal solution is still valid S=540 and D-252.

Max 7T + 5C(profit) Subject to the constraints: 3T + 4C < 2400 (carpentry hrs) 2T + 1C < 1000 (painting hrs) C < 450 (max # chairs) T > 100 (min # tables) T, C > 0 (nonnegativity)

What if the profit contribution for tables changed from $7 to $8 per table? 8 Max 7 T + 5 C(profit) Clearly profit goes up, but would we want to make more tables and less chairs? (i.e. Does the optimal solution change?) Find the range of optimality with graph. X

T C Optimal Corner (T=320, C=360) Still optimal Feasible Region Original Objective Function 7T + 5 C = $4040 Revised Objective Function 8T + 5 C = $4360

C Feasible Region T What if the OFC became higher? Or lower? 11T + 5C = $5500 Optimal Solution (T=500, C=0) 3T + 5C = $2850 Optimal Solution (T=200, C=450) Both have new optimal corner points

 There is a range for each OFC where the current optimal corner point remains optimal.  If the OFC changes beyond that range a new corner point becomes optimal.  Excel’s Solver will calculate the OFC range.

What if painting hours available changed from 1000 to 1300? T + 1C < 1000 (painting hrs) This increase in resources could allow us to increase production and profit. X

 The constraint line shifts, which could change the feasible region  Slope of constraint line does not change  Corner point locations can change  The optimal solution can change

T C Original Feasible Region 2T + 1 C = T + 1 C = 1300 Feasible region becomes larger New optimal corner point (T=560,C=180) Profit=$4820 Old optimal corner point (T=320,C=360) Profit=$4040

New profit = $4,820 Old profit = $4,040 Profit increase = $780 from 300 additional painting hours $2.60 in profit per hour of painting  Each additional hour will increase profit by $2.60  Each hour lost will decrease profit by $2.60

Decision: How many of each of 4 products to make? Objective: Maximize profit Decision Variables: V = number of VCR’s S = number of stereos T = number of TV’s D = number of DVD players

Max 29V + 32S + 72T + 54D(in $ of profit) Subject to the constraints: 3V + 4S + 4T + 3D < 4700 (elec. components) 2V + 2S + 4T + 3D < 4500 (nonelec. components) V + S + 3T + 2D < 2500 (assembly hours) V, S, T, D > 0(nonnegativity) Go to file 4-2.xls

RHS Change Questions  What if the supply of nonelectrical components changes?  What happens if the supply of electrical components  increased by 400 (to 5100)?  increased by 4000 (to 8700)?

 What if we could buy an additional 400 elec. components for $1 more than usual? Would we want to buy them?  What if would could get an additional 250 hours of assembly time by paying $5 per hour more than usual? Would this be profitable?

We are not currently making any VCR’s (V=0) because they are not profitable enough. How much would profit need to increase before we would want to begin making VCR’s?

(marginal contribution to the obj. func. value) -(marginal value of resources used) =Reduced Cost marginal profit of a VCR = $29 - marginal value of resources= ? Reduced Cost of a VCR= - $1.0

Reduced Cost is:  The minimum amount by which the OFC of a variable should change to cause that variable to become non-zero.  The amount by which the objective function value would change if the variable were forced to change from 0 to 1.

 For what range of profit contributions for DVD players will the current solution remain optimal?  What happens to profit if this value drops to $50 per DVD player?

May be present when there are 0’s in the Allowable Increase or Allowable Decrease values for OFC values.

All changes discussed up to this point have involved only 1 change at a time. What if several OFC’s change? Or What if several RHS’s change? Note: they cannot be mixed

∑ (change / allowable change) < 1 RHS Example  Electrical components decrease / 950 =  Assembly hours increase / = The sensitivity report can still be used

Suppose they are considering selling a new product, Home Theater Systems (HTS) Need to determine whether making HTS’s would be sufficiently profitable Producing HTS’s would take limited resources away from other products

 To produce one HTS requires: 5 electrical components 4 nonelectrical components 4 hours of assembly time  Can shadow prices be used to calculate reduction in profit from other products? ( check 100% rule) 5/ / /1325 = < 1

elec cpnts5 x $ 2 = $10 nonelec cpnts4 x $ 0 = $ 0 assembly hrs4 x $24 = $96 $106 Making 1 HTS will reduce profit (from other products) by $106 Shadow Prices

Need (HTS profit contribution) > $106 Cost to produce each HTS: elec cpnts5 x $ 7 = $35 nonelec cpnts4 x $ 5 = $20 assembly hrs4 x $10 = $40 $95 (HTS profit contribution) = (selling price) - $95 So selling price must be at least $201

 Marketing estimates that selling price should not exceed $175  Producing one HTS will cause profit to fall by $26 ($201 - $175) Go to file 4-3.xls

Burn-Off makes a “miracle” diet drink Decision: How much of each of 4 ingredients to use? Objective: Minimize cost of ingredients

Units of Chemical per Ounce of Ingredient Chemical Ingredient Requirement ABCD X34810> 280 units Y5366> 200 units Z < 1050 units $ per ounce of ingredient $0.40$0.20$0.60$0.30

Min 0.40A B C D ($ of cost) Subject to the constraints A + B + C + D > 36 (min daily ounces) 3A + 4B + 8C + 10D > 280 (chem x min) 5A + 3B + 6C + 6D > 200 (chem y min) 10A + 25B + 20C + 40D < 280 (chem z max) A, B, C, > 0 Go to file 4-5.xls