Lecture 10: Sensitivity Part I: General

Slides:



Advertisements
Similar presentations
The simplex algorithm The simplex algorithm is the classical method for solving linear programs. Its running time is not polynomial in the worst case.
Advertisements

IEOR 4004 Midterm Review (part I)
1. Set up the phase 1 dictionary for this problem and make the first pivot: Maximize X 1 + X X 3 + X 4 subject to -X 1 + X X 4 ≤ -3 -X 1 +
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
Linear Programming Problem
Understanding optimum solution
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
Notes 4IE 3121 Why Sensitivity Analysis So far: find an optimium solution given certain constant parameters (costs, demand, etc) How well do we know these.
Sensitivity Analysis Sensitivity analysis examines how the optimal solution will be impacted by changes in the model coefficients due to uncertainty, error.
SENSITIVITY ANALYSIS.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Lecture 10: Sensitivity Part I: General AGEC 352 Spring 2011 – February 28 R. Keeney.
Lecture 9: Optimization with a Min objective AGEC 352 Spring 2011 – February 16 R. Keeney.
Operations Management Dr. Ron Lembke
Lecture 11: Sensitivity Part II: Prices AGEC 352 Spring 2011 – March 2 R. Keeney.
Lecture 5: Objective Equations AGEC 352 Spring 2011 – January 31 R. Keeney.
1 Linear Programming Using the software that comes with the book.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Spreadsheet Modeling & Decision Analysis:
Chapter 3 An Introduction to Linear Programming
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
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
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
Special Conditions in LP Models (sambungan BAB 1)
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.
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
Lecture 11.5: Sensitivity Part III: Ranges AGEC 352 Fall 2012—October 22 R. Keeney.
Managerial Decision Making and Problem Solving
1 1 Slide Linear Programming (LP) Problem n A mathematical programming problem is one that seeks to maximize an objective function subject to constraints.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Chapter 7 Introduction to Linear Programming
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Lecture 8: Optimization with a Min objective AGEC 352 Spring 2012 – February 8 R. Keeney.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
MIT and James Orlin © The Geometry of Linear Programs –the geometry of LPs illustrated on GTC.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
The number of procedures by type and data about rev/costs. The summary section, includes a change area, which shows the difference between the current.
Practice: Given the following Sensitivity Analysis Report
An Introduction to Linear Programming
An Introduction to Linear Programming Pertemuan 4
Chap 10. Sensitivity Analysis
Solve Systems of Linear Equations by Elimination
MAN 305 OPERATIONS RESEARCH II Week 4 –Sensitivity Analysis with Spreadsheets DR. KAZIM BARIŞ ATICI.
prepared by Imran Ismail
Graphical Analysis – the Feasible Region
Chapter 4 Linear Programming: The Simplex Method
Linear Programming in Two Dimensions
Introduction to linear programming (LP): Minimization
Well, just how many basic
ISyE 4231: Engineering Optimization
Linear Programming Excel Solver.
Section 3.4 Sensitivity Analysis.
Linear Programming Problem
Practical Issues Finding an initial feasible solution Cycling
Presentation transcript:

Lecture 10: Sensitivity Part I: General AGEC 352 Fall 2011 – October 15 R. Keeney

Simple Problem Corner Points: (x,y) (10,0) (10,10) (0,10) Solution x = 10, y = 10, Z=20 Both constraints bind

Two Initial Questions 1) If we add a constraint, is the decision maker in the problem… Better off? Worse off? Indifferent? 2) If we remove a constraint, is the decision maker in the problem… Try to find examples that produce each result to prove to ourselves the implications

Question 1: A new constraint with no impact on the objective variable The new constraint says the sum of x and y has to be less than 100 The maximized value from the original problem was Z=x+y=20 Clearly the objective variable will be unaffected by this new constraint DM is indifferent to this addition

Question 1: A new constraint with an adverse impact on the objective Is our solution to the initial problem still feasible? 2(10)+10 = 30 which fails the new constraint

Question 1: A new constraint generating an improvement Added constraints can have two impacts on the feasible space Leave it unchanged Shrink it Since the new constraint cannot expand the feasible space it would be impossible to find a new constraint that makes the decision maker better off.

Question 2: Removing a constraint Left for you to think through Key concept: Adding a constraint can leave the feasible space unchanged or shrink it Show that removal of a constraint can leave the feasible space unchanged or expand it Implications for the decision maker’s objective variable are going to be opposite

Simple 3 variable problem q is a new choice variable q competes with x in the constraint q is worth ½ as much as x in the objective equation Note that y is unaffected by the new choice variable q. Increasing y increases the objective variable so we can set y to 10 (its highest level) and just consider the choice between x and q.

2 Initial Questions when adding a choice variable Will the addition of a choice variable make the decision maker… Better off? Worse off? Indifferent? Will the removal of a choice variable make the decision maker… Again work with a simple example to try and prove which are possible.

Impact of Adding q to the problem Optimal y = 10 is assumed but not shown Choice between x and q graphed Objective says use only x and set q=0 Adding q to the problem has no impact in this instance

Another possibility of adding q Now q enters the objective equation with a coefficient of 1.5 Graphical solution says x=0,q=10 Remember y=10 New Z = 10 + (1.5)(10) So adding q increased the objective value

Can a new decision variable be deterimental? Not possible unless it comes with a constraint that forces its value to be a non-zero value In this example, q was initially not worth pursuing, so the solution was to just set it to zero What about removing a decision variable? Beginning with the problem having x,y,q consider the impact of taking q away (returning to the initial problem) What possibilities exist for the decision maker being better/worse/indifferent?

Review Exercises The minimization case is left to you in the handout to work out the sensitivity of the objective variable to added constraints or decision variable Look through the review handout and ask any questions on Wednesday that you do not understand Wednesday we will review shadow price sensitivity

General Sensitivity Summary Adding a constraint Worse off Z decreases for max Z increases for min Indifferent (Z is the same) Adding a variable Better off Z increases for max Z decreases for min