Sensitivity Analysis Consider the CrossChek hockey stick production problem:   Management believes that CrossChek might only receive $120 profit from the.

Slides:



Advertisements
Similar presentations
Linear Programming Sensitivity Analysis How will a change in a coefficient of the objective function affect the optimal solution? How will a change in.
Advertisements

Sensitivity Analysis Consider the CrossChek hockey stick production problem: Management believes that CrossChek might only receive $120 profit from the.
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
1 Lecture 3 MGMT 650 Sensitivity Analysis in LP Chapter 3.
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.
LP EXAMPLES.
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Chapter 4: Linear Programming Sensitivity Analysis
1 1 Slide Chapter 14: Goal Programming Goal programming is used to solve linear programs with multiple objectives, with each objective viewed as a "goal".
1 Linear Programming Using the software that comes with the book.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
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.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
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 Chapter 13 Supplement.
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.
Presentation: H. Sarper
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Optimization Models Mathematical optimization models usually contain an objective (what to do) constraints (the rules that must be followed). Also referred.
Chapter Topics Computer Solution Sensitivity Analysis
CrossChek Sporting Goods CrossChek Sporting Goods is a manufacturer of sporting goods, including golf clubs, hockey equipment, bats, balls and all things.
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.
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.
Chapter 6 Supplement Linear Programming.
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.
Range of Feasibility For phase 2 of manufacturing, the allowable increase is 40 (LINDO) Thus the dual price of $125 is valid for any increase in the allowable.
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.
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.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
Chapter 4 Linear Programming: The Simplex Method
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.
What-If Analysis for Linear Programming
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.
SENSITIVITY ANALYSIS. 2 Sensitivity Analysis Sensitivity analysis is carried out after optimal solution is found. Hence called as post optimality analysis.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
St. Edward’s University
BIA 674 – Supply Chain Analytics
Chapter 5 Sensitivity Analysis: An Applied Approach
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
St. Edward’s University
Sensitivity.
Linear Programming – Sensitivity Analysis
Linear Programming Problem
Presentation transcript:

Sensitivity Analysis Consider the CrossChek hockey stick production problem:   Management believes that CrossChek might only receive $120 profit from the sale of each lower-profit hockey stick. Will that affect the optimal solution? What about a (separate) change in the profit from higher-profit sticks to $125? Consider two high-end hockey sticks, A and B. $150 and $200 profit are earned from each sale of A and B, respectively. Each product goes through 3 phases of production. A requires 1 hour of work in phase 1, 48 min in phase 2, and 30 min in phase 3. B requires 40 min, 48 min and 1 hour, respectively. Limited manufacturing capacity: phase 1 1000 total hours phase 2 960 phase 3 1000 How many of each product should be produced? Maximize profit Satisfy constraints. Max 150x1 + 200x2 s.t x1 + 2/3x2 <= 1000 4/5x1 + 4/5x2 <= 960 1/2x1 + x2 <= 1000 x1, x2 >= 0  

Constraint Sensitivity What if 4 more hours were allocated to phase 2 of the manufacturing stage? Thus the constraint: 4/5x1 + 4/5x2 <= 964 New profit = 220500 Original was 220000, so these 4 hours translate into $500 more profit

Constraint Sensitivity What if 8 more hours were allocated to phase 2 of the manufacturing stage? Thus the constraint: 4/5x1 + 4/5x2 <= 968 New profit = 221000 Original was 220000, so these 4 hours translate into $1000 more profit How much more profit if increased by 12 hours? $1500?

Example 2000 x1 + 2/3x2 = 1000 4/5x1 + 4/5x2 = 1000 1000 Solution: x1 = 400, x2 = 800 Objective line Slope = -3/4 1/2x1 + x2 = 1000 1000 2000

Move a constraint 2000 x1 + 2/3x2 = 1000 4/5x1 + 4/5x2 = 1000 1000 Solution: x1 = 400, x2 = 800 Objective line Slope = -3/4 1/2x1 + x2 = 1000 1000 2000

Move a constraint 2000 x1 + 2/3x2 = 1000 4/5x1 + 4/5x2 = 1000 1000 New solution Objective line Slope = -3/4 1/2x1 + x2 = 1000 1000 2000

Dual Prices The dual price of a constraint is the improvement in the optimal solution, per unit increase in the right-hand side value of the constraint. The dual price of the processor configuration constraint is thus $500/4 = $125. A negative dual price indicates how much worse the objective function value will get with each unit increase

Move a constraint 2000 x1 + 2/3x2 = 1000 4/5x1 + 4/5x2 = 1000 1000 New solution Objective line Slope = -3/4 1/2x1 + x2 = 1000 1000 2000

Move the constraint further 2000 x1 + 2/3x2 = 1000 4/5x1 + 4/5x2 = 1000 1000 Solution unchanged! Objective line Slope = -3/4 1/2x1 + x2 = 1000 1000 2000

Range of Feasibility The dual price may only be applicable for small increases. Large increases may result in a change in the optimal extreme point, and thus increasing this value further may not have the same effect. The range of values the right-hand side can take without affecting the dual price is called the range of feasibility. This is similar to the concept of range of optimality for objective function coefficients. There is no easy way to manually calculate these ranges, but they can be found under the RIGHT HAND SIDE RANGES heading in LINDO.

Range of Feasibility For phase 2 of manufacturing, the allowable increase is 40 (LINDO) Thus the dual price of $125 is valid for any increase in the allowable hours for phase 2, up to 960 + 40 = 1000 i.e. any increase n (<= 40) added to 960 will increase the objective value by $125n. Any increase x (> 40) added to 960 may or may not increase the objective value by $125x.

Example The range of feasibility for the phase 2 constraint is [800, 1000]. What is the value of objective function if the right-hand side is changed to: 1000: 125*40=5000  220000 + 5000 = 225000 860: 125*-100 = -12500 220000-12500 = 207500 700: don’t know

The 100% rule for constraint right-hand sides To determine whether simultaneous changes will not change dual prices For each constraint: Compute change as a percentage of the allowable change Sum all percentage changes If the sum is less than or equal to 100%, the dual prices will not change If the sum exceeds 100%, the dual prices may change

Consolidated Electronics As part of a quality improvement initiative, Consolidated Electronics employees complete a three-day training program on teaming and a two-day training program on problem solving. The manager of quality improvement has requested that at least 8 training programs on teaming and at least 10 training programs on problem solving be offered during the next six months. In addition, senior-level management has specified that at least 25 training programs must be offered during this period. Consolidated Electronics uses a consultant to teach the training programs. During the next six months, the consultant has up to 84 days of training time available. Each training program on teaming costs $10,000 and each training program on problem solving costs $8,000. Determine the number of training programs on each teaming and problem solving that minimizes cost.

Post-Optimality Analysis What will happen to the optimal solution if the cost of each training program on teaming is decreased to $9000? What will happen to the optimal solution if the cost of each training program on problem solving is increased to $9500? What if both changes occur simultaneously? What will be the new overall minimum cost if the minimum total number of courses is increased from 25 to 27? What will be the new overall minimum cost if the total number of days available for training is decreased from 84 to 64? 54? What will be the new overall minimum cost if the minimum total number of training courses on teaming is decreased from 8 to 5? What will be the new overall minimum cost if the minimum total number of training courses on teaming is decreased from 8 to 2 but the minimum total number of courses is increased from 25 to 26?