1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.

Slides:



Advertisements
Similar presentations
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Advertisements

Understanding optimum solution
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.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
Linear and Integer Programming Models
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Operations Management Linear Programming Module B - Part 2
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Operations Management Dr. Ron Lembke
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.
Chapter 4: Linear Programming Sensitivity Analysis
QM B Linear Programming
Sensitivity of the Objective Function Coefficients
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
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 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.
Linear Programming Sensitivity of the Objective Function Coefficients.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Readings Readings Chapter 3
Introduction to Management Science
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
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.
Chapter 6 Supplement Linear Programming.
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.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
1 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Adeyl Khan, Faculty, BBA, NSU 1 Introduction to Linear Programming  A Linear Programming model seeks to maximize or minimize a linear function, subject.
Sensitivity Analysis Introduction to Sensitivity Analysis
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
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.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
Linear Programming Chapter 14 Supplement Lecture Outline Model Formulation Graphical Solution Method Linear Programming Model Solution Solving Linear.
Solving Linear Optimization Problems Using the Solver Add-in.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Linear Programming.
Linear Programming: Sensitivity Analysis and Duality
Graphical Analysis – the Feasible Region
Sensitivity.
Linear Programming Excel Solver.
Optimization Models Module 9.
Solving Linear Optimization Problems Using the Solver Add-in
Linear Programming: Computer Solution and Sensitivity Analysis
Presentation transcript:

1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking this question: –Parameter values used were only best estimates. –Dynamic environment may cause changes. –“What-if” analysis may provide economical and operational information.

2 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1 - X 2  350 (Mix) X j > = 0, j = 1,2 (Nonnegativity) The Galaxy Linear Programming Model

3 Range of Optimality –The optimal solution will remain unchanged as long as An objective function coefficient lies within its range of optimality There are no changes in any other input parameters. –The value of the objective function will change if the coefficient multiplies a variable whose value is nonzero. Sensitivity Analysis of Objective Function Coefficients.

X2X2 X1X1 Max 8X 1 + 5X 2 Max 4X 1 + 5X 2 Max 3.75X 1 + 5X 2 Max 2X 1 + 5X 2 Sensitivity Analysis of Objective Function Coefficients.

X2X2 X1X1 Max8X 1 + 5X 2 Max 3.75X 1 + 5X 2 Max 10 X 1 + 5X 2 Range of optimality: [3.75, 10] (Coefficient of X 1 ) Sensitivity Analysis of Objective Function Coefficients.

6 Reduced cost Assuming there are no other changes to the input parameters, the reduced cost for a variable X j that has a value of “0” at the optimal solution is: –The negative of the objective coefficient increase of the variable X j (-  C j ) necessary for the variable to be positive in the optimal solution – Alternatively, it is the change in the objective value per unit increase of X j. Complementary slackness At the optimal solution, either the value of a variable is zero, or its reduced cost is 0.

7 In sensitivity analysis of right-hand sides of constraints we are interested in the following questions: –Keeping all other factors the same, how much would the optimal value of the objective function (for example, the profit) change if the right-hand side of a constraint changed by one unit? –For how many additional or fewer units will this per unit change be valid? Sensitivity Analysis of Right-Hand Side Values

8 Any change to the right hand side of a binding constraint will change the optimal solution. Any change to the right-hand side of a non- binding constraint that is less than its slack or surplus, will cause no change in the optimal solution. Sensitivity Analysis of Right-Hand Side Values

9 Shadow Prices Assuming there are no other changes to the input parameters, the change to the objective function value per unit increase to a right hand side of a constraint is called the “ Shadow Price ”

X2X2 X1X1 2X 1 + 1x 2 <=1000 When more plastic becomes available (the plastic constraint is relaxed), the right hand side of the plastic constraint increases. Production time constraint Maximum profit = $4360 2X 1 + 1x 2 <=1001 Maximum profit = $ Shadow price = – = 3.40 Shadow Price – graphical demonstration The Plastic constraint

11 Range of Feasibility Assuming there are no other changes to the input parameters, the range of feasibility is –The range of values for a right hand side of a constraint, in which the shadow prices for the constraints remain unchanged. –In the range of feasibility the objective function value changes as follows: Change in objective value = [Shadow price][Change in the right hand side value]

12 Range of Feasibility X2X2 X1X1 2X 1 + 1x 2 <=1000 Increasing the amount of plastic is only effective until a new constraint becomes active. The Plastic constraint This is an infeasible solution Production time constraint Production mix constraint X 1 + X 2  700 A new active constraint

13 Range of Feasibility X2X2 X1X1 The Plastic constraint Production time constraint Note how the profit increases as the amount of plastic increases. 2X 1 + 1x 2  1000

14 Range of Feasibility X2X2 X1X1 2X 1 + 1X 2  1100 Less plastic becomes available (the plastic constraint is more restrictive). The profit decreases A new active constraint Infeasible solution

15 Other Post - Optimality Changes Addition of a constraint. Deletion of a constraint. Addition of a variable. Deletion of a variable. Changes in the left - hand side coefficients.

16 Using Excel Solver to Find an Optimal Solution and Analyze Results To see the input screen in Excel click Galaxy.xlsGalaxy.xls Click Solver to obtain the following dialog box. Equal To: By Changing cells These cells contain the decision variables $B$4:$C$4 To enter constraints click… Set Target cell $D$6 This cell contains the value of the objective function $D$7:$D$10 $F$7:$F$10 All the constraints have the same direction, thus are included in one “Excel constraint”.

17 Using Excel Solver To see the input screen in Excel click Galaxy.xlsGalaxy.xls Click Solver to obtain the following dialog box. Equal To: $D$7:$D$10<=$F$7:$F$10 By Changing cells These cells contain the decision variables $B$4:$C$4 Set Target cell $D$6 This cell contains the value of the objective function Click on ‘Options’ and check ‘Linear Programming’ and ‘Non-negative’.

18 To see the input screen in Excel click Galaxy.xlsGalaxy.xls Click Solver to obtain the following dialog box. Equal To: $D$7:$D$10<=$F$7:$F$10 By Changing cells $B$4:$C$4 Set Target cell $D$6 Using Excel Solver

19 Using Excel Solver – Optimal Solution

20 Using Excel Solver – Optimal Solution Solver is ready to provide reports to analyze the optimal solution.

21 Using Excel Solver –Answer Report

22 Using Excel Solver –Sensitivity Report

23 Another Example: Cost Minimization Diet Problem Another Example: Cost Minimization Diet Problem Mix two sea ration products: Texfoods, Calration. Minimize the total cost of the mix. Meet the minimum requirements of Vitamin A, Vitamin D, and Iron.

24 Decision variables –X1 (X2) -- The number of two-ounce portions of Texfoods (Calration) product used in a serving. The Model Minimize 0.60X X2 Subject to 20X1 + 50X2  100Vitamin A 25X1 + 25X2  100 Vitamin D 50X1 + 10X2  100 Iron X1, X2  0 Cost per 2 oz. % Vitamin A provided per 2 oz. % required Cost Minimization Diet Problem

Feasible Region Vitamin “D” constraint Vitamin “A” constraint The Iron constraint The Diet Problem - Graphical solution

26 Summary of the optimal solution –Texfood product = 1.5 portions (= 3 ounces) Calration product = 2.5 portions (= 5 ounces) –Cost =$ 2.15 per serving. –The minimum requirement for Vitamin D and iron are met with no surplus. –The mixture provides 155% of the requirement for Vitamin A. Cost Minimization Diet Problem