Lecture 6 Linear Programming Sensitivity Analysis

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.
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.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
SENSITIVITY ANALYSIS.
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.
Sensitivity analysis BSAD 30 Dave Novak
Chapter 4: Linear Programming Sensitivity Analysis
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
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
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.
Computational Methods for Management and Economics Carla Gomes
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Special Conditions in LP Models (sambungan BAB 1)
Readings Readings Chapter 3
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.
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.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Managerial Decision Modeling with Spreadsheets Chapter 4 Linear Programming Sensitivity Analysis.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Lecture 1 Modeling: Linear Programming I
MIT and James Orlin © Chapter 5. Sensitivity Analysis presented as FAQs –Points illustrated on a running example of glass manufacturing. –Also the.
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.
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.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
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.
What-If Analysis for Linear Programming
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Lecture 8 Integer Linear Programming
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.
OSCM 230 Fall 2013 Management Science Lecture 4 Linear Programming II 9/11/2013, 9/16/ Lecture 4 Linear Programming II Professor Dong Washington.
Linear Programming Case Study: Parket Sisters
Sensitivity Analysis Introduction to Sensitivity Analysis
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.
Linear Programming Technical Supplement 1 Linear Programming Copyright © 2014 by the McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Linear Programming: Sensitivity Analysis and Duality
St. Edward’s University
Chapter 5 Sensitivity Analysis: An Applied Approach
Sensitivity Analysis and
Sensitivity.
Presentation transcript:

Lecture 6 Linear Programming Sensitivity Analysis 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Professor Dong Washington University in St. Louis, MO Baseball Elimination 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Professor Dong Washington University in St. Louis, MO Baseball Elimination 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Professor Dong Washington University in St. Louis, MO Introduction In general, we are never content with only the optimal solution to a linear program and want to acquire insight into the economics of the situation we are modeling For example, we may want to know how sensitive our solution is to changes in the objective function or changes in some of the constraints. (Why?) Frequently, firms may want to invest in order to alleviate constraints: how exactly should a potential investment be allocated Sensitivity analysis is vital to the intelligent use of any optimal LP solution 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Professor Dong Washington University in St. Louis, MO Introduction The first part of the lecture gives an “operational overview” of the most important concepts in sensitivity analysis. In the first part, we’ll learn “how to” using Excel output Then we’ll try to dig deeper and explore some of the “why” questions For example, we’ll learn that sensitivity analysis offers a unique insight into the properties of the optimal solution of any linear program 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

What is Sensitivity Analysis? The study of how changes in the parameters of a linear program affect the optimal solution (xi*) and the optimal objective function value Objective (OBJ) function: Change in coefficients MAX(MIN) c1 x1 + c2 x2 + c3 x3 + …. cn xn ST: A11 x1 + A12 x2 + A13 x3 + …. A1n xn ≤ (≥) B1 A21 x1 + A22 x2 + A23 x3 + …. A2n xn ≤ (≥) B2 A31 x1 + A32 x2 + A33 x3 + …. A3n xn ≤ (≥) B3 ……… Am1 x1 + Am2 x2 + Am3 x3 + …. Amn xn ≤ (≥) Bm xi's ≥ 0 or unrestricted in sign Constraints: Change in RHS constants Professor Dong Washington University in St. Louis, MO

Why Sensitivity Analysis ? Model Results Analysis Sensitivity Analysis Understand tradeoffs Make quick adjustments Build intuition Symbolic World Real Managerial Judgement Abstraction Interpretation An example: PC industry, different distribution strategies Model: simple spreadsheet with some structure. Factors cannot be captured by model. Qualitative and quantitative analysis reach final decision. Management Situation Intuition Decisions 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Sensitivity Report in Excel Profit Contribution Maximize 10 x1 + 9 x2 Subject to: Cutting & Dyeing: 7/10 x1 + x2 ≤ 630 Sewing: 1/2 x1 + 5/6 x2 ≤ 600 Finishing: x1 + 2/3 x2 ≤ 708 Inspection & Packaging: 1/10 x1 + 1/4 x2 ≤ 135 Non-negative: x1 ≥ 0 , x2 ≥ 0 Optimal Solution: x1=540, x2=252 Optimal profit: 10*540+9*252 =7668 Sensitivity Report OBJ function related analysis Constraints related analysis 9/23/2013, 9/25/2013

Professor Dong Washington University in St. Louis, MO Agenda Example: Par Inc Objective function: Change in coefficient “allowable increase” and “allowable decrease” “reduced cost” Constraints: Change in right-hand-side constants “shadow price” Simultaneous changes “100% rule” Summary 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Change in OBJ Function Coefficient Q1. What if the unit profit of the deluxe bag is $10 instead of $9? What will happen to the optimal production plan and the optimal profit? Max 10 x1 + 9 x2 Cutting & Dyeing 7/10 x1 + x2 ≤ 630 Sewing 1/2 x1 + 5/6 x2 ≤ 600 Finishing x1 + 2/3 x2 ≤ 708 Inspection & Packaging 1/10 x1 + 1/4 x2 ≤ 135 x1 ≥ 0, x2 ≥ 0, 10 x1 + 10 x2 10 -9 ≤ 5.29 (the allowable increase of the coefficient of x2 ) => Solution (540, 252) does NOT change New profit = old profit + (10-9)×252 = 7668+252=7920

Professor Dong Washington University in St. Louis, MO “Allowable Increase” and “Allowable Decrease” in the “Adjustable Cells” Suppose Let “Allowable” ranges tell you how much the coefficient of a given decision variable in the objective function may be increased or decreased without changing the optimal solution (the value of the decision variables xi*), where all other data are assumed to be fixed. Calculate the new Objective Function Value (OVnew) When Ci is within the “Allowable” range: xnew* =xold* When Ci is outside the “Allowable” range: xnew* ≠ xold*, re-formulate LP and resolve! 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Change in OBJ Function Coefficient – Graphical Interpretation (540, 252) remains optimal as long as the objective function stays within the cone formed by the binding constraints (here finishing and cutting & dyeing are binding constraints) Iso-profit line (540,252) 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Change in RHS Value of A Constraint – Shadow Price Q2: What if an additional 10 hours of production time is available in cutting & dyeing? What will happen to the optimal production plan and the optimal profit? Max 10 x1 + 9 x2 Cutting & Dyeing 7/10 x1 + x2 ≤ 630 Sewing 1/2 x1 + 5/6 x2 ≤ 600 Finishing x1 + 2/3 x2 ≤ 708 Inspection & Packaging 1/10 x1 + 1/4 x2 ≤ 135 x1 ≤ 0, x2 ≤ 0, 7/10 x1 + x2 ≤ 640 640 - 630 = 10 ≤ 52.36 (where 52.36 is the allowable increase of RHS of C&D constraint) => New profit = Old profit +shadow price×RHS change = 7668 + 4.375×(640-630) = 7711.75.

Interpretations of Shadow Price Is the amount by which the objective function value changes given a unit increase in the RHS value of the constraint represents the marginal value of resource, its marginal impact on the OBJ value assuming all other coefficients remain constant “Allowable Increase” and “Allowable Decrease” in Constraints “Allowable increase”= increase over which shadow price holds “Allowable Decrease” = decrease over which shadow price holds Suppose Let When Bj is within the “Allowable” range : shadow price can be used in the following way OVnew = OVold + shadow price * ΔBj For binding constraint: optimal solution will be different, re-formulate LP, and re-solve For non-binding constraint: optimal solution will be the same. When Bj is outside this “Allowable” range: cannot use the shadow price for changes outside the “Allowable” range , re-formulate LP, re-solve.

Effective Range for Shadow Price Effective range for shadow price is specified by “Allowable Increase” and “Allowable Decrease” of CONSTRAINTS Iso-profit line New Optimal Solution New C&D constraint Old Optimal Solution Old C&D constraint 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Change in OBJ Function Coefficient - Reduced Cost Q3. Suppose we have the following golf bag problem: Max 10 x1 + 6 x2 Cutting & Dyeing 7/10 x1 + x2 ≤ 630 Sewing 1/2 x1 + 5/6 x2 ≤ 600 Finishing x1 + 2/3 x2 ≤ 708 Inspection & Packaging 1/10 x1 + 1/4 x2 ≤ 135 x1≤ 0, x2≤ 0, => Optimal solution: (708, 0) Q3. What minimal unit profit should the deluxe bag generate in order to have positive production? Professor Dong Washington University in St. Louis, MO

Reduced Cost – Graphical Interpretation Reduced Cost of a product = difference between its marginal contribution to the OBJ function value and the marginal value of the resources it consumes Producing 1 unit deluxe bag consumes Resource hr Shadow price C&D: 1 0 S: 5/6 0 F: 2/3 10 I&P: ¼ 0_______ The marginal value of the resources it consumes is 1*0+5/6*0 +2/3*10+1/4*0=20/3 The minimum unit profit of deluxe bag should be 20/3=6.67 = (6+0.67) in order to have positive production. The current unit profit of deluxe bag is 6. Therefore, reduced cost = 6-20/3 =2/3 = 0.67, i.e., producing 1 unit deluxe bag reduces profit by 0.67. 10 x1 + (20/3) x2 =7080 10 x1 + 6x2 =7080 9/23/2013, 9/25/2013

Simultaneous Changes in Parameters 1. If all changes are in the objective function coefficients, then you can use the 100% rule. 2. If all changes are in the RHS values, then you can use the 100% rule. 3. If changes are in both the objective function and RHS, you must reformulate and re-solve! 4. If unsure, reformulate and re-solve! 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Professor Dong Washington University in St. Louis, MO 100% Rule For all changes that are made, sum the percentages of increase-changes with respect to (w.r.t.) the corresponding “Allowable Increases” and the percentages of decrease-changes w.r.t. the corresponding “Allowable Decreases,” in absolute values. 2. For simultaneous OBJ coefficient changes, if the sum of the percentage changes does not exceed 100%, the optimal solution will not change. 3. For simultaneous RHS changes, if the sum of the percentage changes does not exceed 100%, the shadow prices apply. 4. If the sum of the percentage changes DOES exceed 100%, then reformulate and re-solve! 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO

Simultaneous Changes Q4. If the unit profit of the standard bag decreases to $8 and the unit of deluxe bag increases to $10, does the current production plan remain optimal? |10 - 8|/3.7 + |10 -9|/5.29 = 0.7296 < 100% Production plan remains optimal New Profit = old profit +(8-10)×540 + (10-9)×252 = $6840

Professor Dong Washington University in St. Louis, MO 9/23/2013, 9/25/2013 Professor Dong Washington University in St. Louis, MO