Exam Feb 28: sets 1,2 Set 2 due Thurs. LP SENSITIVITY Ch 3.

Slides:



Advertisements
Similar presentations
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Advertisements

LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Understanding optimum solution
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 9 Linear.
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.
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
LP EXAMPLES.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Introduction to Management Science
Chapter 4: Linear Programming Sensitivity Analysis
Linear Programming: Fundamentals
1 Linear Programming Using the software that comes with the book.
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Linear Programming.
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
Chapter 3 Introduction to optimization models. Linear Programming The PCTech company makes and sells two models for computers, Basic and XP. Profits for.
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.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming Chapter 13 Supplement.
Readings Readings Chapter 3
Introduction to Management Science
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
Chapter Topics Computer Solution Sensitivity Analysis
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 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 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.
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.
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.
Sensitivity Analysis Introduction to Sensitivity Analysis
LP SENSITIVITY. Graphical Sensitivity Analysis A.Objective Function B.Left-hand side of constraint C.Right-hand side of constraint.
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.
St. Edward’s University
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Chapter 5 Sensitivity Analysis: An Applied Approach
Graphical Analysis – the Feasible Region
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Graphical Sensitivity Analysis and Computer Solution
Duality Theory and Sensitivity Analysis
St. Edward’s University
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Section 3.4 Sensitivity Analysis.
Linear Programming – Sensitivity Analysis
Optimization Theory Linear Programming
Optimization Models Module 9.
Presentation transcript:

Exam Feb 28: sets 1,2 Set 2 due Thurs

LP SENSITIVITY Ch 3

Sensitivity Analysis I.GRAPHICAL A.Objective Function B.Left-hand side of constraint C.Right-hand side of constraint II. ALGEBRA

SENSITIVITY ANALYSIS Does optimal solution change if input data changes?

INSENSITIVE

SENSITIVE

SENSITIVITY ANALYSIS Estimation error Change over time? Input might be random variable Should we remove constraint? “What if?” questions

I. GRAPHICAL NEW EXAMPLE: RENDER AND STAIR QUANTITATIVE ANALYSIS X1 = NUMBER OF CD PLAYERS X2 = NUMBER OF RECEIVERS

ORIGINAL PROBLEM MAX PROFIT = 50X X2 SUBJECT TO CONSTRAINTS (1) ELECTRICIAN CONSTRAINT: 2X1 + 4X2 < 80 (2) AUDIO TECHNICIAN CONSTR: 3X1+ X2 < 60 NEXT SLIDE: REVIEW OF LAST WEEK

PLAYER RECEIVER AUDIO 0,60 20,0 ELEC 0,20 40,0 16,12

MAXIMUM PROFIT PLAYERS=X1RECEIVERS =X2 PROFIT= 50X1+120X =MAX

PLAYER RECEIVER AUDIO 0,60 20,0 ELEC 0,20 40,0 16,12 MAX

ORIGINAL PROBLEM MAKE RECEIVERS ONLY NOW WE WILL BEGIN TO CONSIDER “WHAT IF” QUESTIONS IF NEW OPTIMUM IS “MAKE RECEIVERS ONLY”, WE CALL IT “OUTPUT INSENSITIVE” IF NEW OPTIMUM IS A DIFFERENT CORNER POINT, “OUTPUT SENSITIVE”

SENSITIVITY ANALYSIS I.A. OBJECTIVE FUNCTION

NEW OBJECTIVE FUNCTION 50X1 + 80X2 NEW PROFIT PER RECEIVER = $80 OLD PROFIT “ “ WAS $120 IS OPTIMUM SENSITIVE TO REDUCED PROFIT, PERHAPS DUE TO LOW PRICE (INCREASED COMPETITION) OR HIGHER COST?

NEW MAXIMUM PROFIT PLAYERS=X1RECEIVERS =X2 PROFIT= 50X1+80X =NEW MAX

PLAYER RECEIVER AUDIO 0,60 20,0 ELEC 0,20 40,0 16,12 MAX OLD =NEW MAX

OUTPUT SENSITIVE WE NOW MAKE BOTH RECEIVERS AND PLAYERS (MIX) ORIGINAL: RECEIVERS ONLY REASON: LOWER PROFIT OF EACH RECEIVER IMPLIES PLAYERS MORE DESIRABLE THAN BEFORE

SENSITIVITY ANALYSIS I.B LEFT –HAND SIDE OF CONSTRAINT

ELECTRICIAN CONSTRAINT OLD: 2X1 + 4X2 < 80 NEW: 2X1 + 5X2<80 REASON: NOW TAKES MORE TIME FORELECTRICIAN TO MAKE ONE RECEIVER(5 NOW VS 4 BEFORE), LOWER PRODUCTIVITY PERHAPS DUE TO WEAR AND TEAR

BACK TO ORIGINAL OBJECTIVE FUNCTION WE COMPARE WITH ORIGINAL PROBLEM, NOT FIRST SENSITIVITY BUT FEASIBLE REGION WILL CHANGE

PLAYER RECEIVER AUDIO 0,60 20,0 ELEC 0,20 40,0 16,12 OLD NEW ELEC 0,16 17,9.2

SMALLER FEASIBLE REGION CAN MAKE FEWER RECEIVERS THAN BEFORE NEW INTERCEPT (0,16) REPLACES (0,20) (0,20) NOW INFEASIBLE ALSO, NEW MIX CORNER POINT: (17,9.2)

NEW MAXIMUM PROFIT PLAYERS=X1RECEIVERS =X2 PROFIT= 50X1+120X =NEW MAX

OUTPUT SENSITIVE COMPARED TO ORIGINAL PROBLEM, A NEW OPTIMUM INCREASED LABOR TO MAKE RECEIVER MAKES PLAYER MORE DESIRABLE

I.C. RIGHT-HAND SIDE OF CONSTRAINT

SLACK VARIABLES S1 = NUMBER OF HOURS OF ELECTRICIAN TIME NOT USED S2 =NUMBER OF HOURS OF AUDIO TIME NOT USED (1) ELEC CONSTR: 2X1+4X2+S1=80 (2) AUDIO CONSTR: 3X1+X2+S2=60

PLAYER RECEIVER AUDIO 0,60 20,0 ELEC 0,20 40,0 16,12 MAX BACK TO ORIGINAL OPTIMUM OPTIMUM ON ELEC CONSTR OPTIMUM NOT ON AUDIO CONSTR

X1=0,X2=20 (1)ELEC: 2(0)+4(20)+S1=80 S1 = 0 NO IDLE ELECTRICIAN (2) AUDIO: 3(0)+20+S2=60 S2 = 60 –20= 40 AUDIO SLACK

INPUT SENSITIVE INPUT SENSITIVE IF NEW OPTIMUM CHANGES SLACK ORIGINAL ELEC SLACK = 0 IF NEW ELEC SLACK > 0, INPUT SENSITIVE IF NEW ELEC SLACK STILL ZERO, INPUT INSENSITIVE

CHANGE IN RIGHT SIDE OLD ELEC CONSTR: 2X1+4X2<80 NEW ELEC CONSTR 2X1+4X2<300 NEW INTERCEPTS: (0,75) & (150,0)

PLAYER RECEIVER AUDIO 0,60 20,0 ELEC 0,20 40,0 16,12 MAX OLD 150,0 0,75 REDUNDANT CONSTR NEW ELEC

PLAYER RECEIVER AUDIO 0,60 20,0 0,20 40,0 MAX 150,0 0,75 REDUNDANT CONSTR OLD

NEW MAXIMUM X1X2PROFIT= 50X1+120X =MAX

PLAYER RECEIVER AUDIO 0,60 20,0 0,20 40,0 MAX 150,0 0,75 REDUNDANT CONSTR OLD INFEASIBLE =NEW MAX NEW ELEC

NEW OPTIMUM OUTPUT INSENSITIVE SINCE WE STILL MAKE RECEIVERS ONLY (SAME AS ORIGINAL) BUT INPUT SENSITIVE ORIGINAL: OPTIMUM ON ELEC CONSTR NEW: OPTIMUM ON AUDIO CONSTR

SLACK SLACK VARIABLE ORIGNEW ELECS1=0S1>0 AUDIOS2>0S2=0

INTERPRET INCREASE IN ELECTRICIAN AVAILABILITY TOO MANY ELECTRICIANS THEREFORE ELEC SLACK

SHADOW PRICE VALUE OF 1 ADDITIONAL UNIT OF RESOURCE INCREASE IN PROFIT IF WE COULD INCREASE RIGHT-HAND SIDE BY 1 UNIT

THIS EXAMPLE SHADOW PRICE = MAXIMUM YOU WOULD PAY FOR 1 ADDITIONAL HOUR OF ELECTRICIAN OLD ELEC CONSTR: 2X1+4X2<80 NEW ELEC CONSTR: 2X1+4X2<81

OPTIMUM X1X2PROFIT= 50X1+120X2 080/4=202400=OLD MAX 081/4= =NEW MAX

SHADOW PRICE = =30 Electrician “worth” up to $30/hr “Dual” value

II. ALGEBRA OBJECTIVE FUNCTION: Z = C1X1 + C2X2, Where C1 and C2 are unit profits

II. Algebra For what range of values of the objective function coefficient C1 does the optimum stay at the current corner point?

Example Source: Taylor, Bernard, INTO TO MANAGEMENT SCIENCE, p 73 X1 = NUMBER OF BOWLS TO MAKE X2 = NUMBER OF MUGS TO MAKE MAX PROFIT = C1X1+C2X2=40X1+50X2 CONSTRAINTS (1) LABOR: X1 + 2X2 < 40 (2) MATERIAL: 4X1+ 3X2 < 120

X1 X2 (1) (2) (24,8)=MAX

Old Optimum Make both bowls and mugs Output insensitive if new solution is also bowls and mugs

STEP 1: SOLVE FOR X2 IN OBJECTIVE FUNCTION WE WANT A RANGE FOR C1, SO WE SOLVE FOR X2 C1 VARIABLE, C2 CONSTANT PROFIT= Z=C1X1 + 50X2 50X2= Z – C1X1 X2 = (Z/50) –(C1/50)X1 COEFFICIENT OF X1 IS –C1/50

STEP2: SOLVE FOR X2 IN CONSTRAINT (1) (1) X1 + 2X2=40 2X2=40-X1 X2=20-0.5X1 COEFFICIENT OF X1 IS –0.5

STEP 3: STEP 1 = STEP 2 -C1/50= -0.5 C1 = 25 OLD C1 = 40 SENSITIVITY RANGE: SAME CORNER POINT OPTIMUM SENSITIVITY RANGE SHOULD INCLUDE OLD C1 C1 > 25

STEP 4: SOLVE FOR X2 IN CONSTRAINT (2) (2) 4X1+3X2=120 3X2= 120-4X1 X2=40-(4/3)X1= X1 COEFICIENT OF X1 IS –1.33

STEP 5: STEP 1 = STEP 4 -C1/50 = C1=67 OLD C1 = 40 RANGE INCLUDES 40 C1 < 67

Step 3 and step 5 25 < C1 < 67 If you strongly believe that C1 is between 25 and 67, optimal solution is same corner point as C1 =40. Make both bowls and mugs if profit per bowl is between $ 25 and $ 67