Lecture 10: Sensitivity Part I: General AGEC 352 Spring 2011 – February 28 R. Keeney.

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

LINEAR PROGRAMMING SENSITIVITY ANALYSIS
Understanding optimum solution
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
LECTURE 14 Minimization Two Phase method by Dr. Arshad zaheer
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.
Lecture 12: Sensitivity Examples (Shadow Price Interpreted) AGEC 352 Spring 2012 – February 29 R. Keeney.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
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.
Sensitivity analysis BSAD 30 Dave Novak
The Laws of Linear Combination James H. Steiger. Goals for this Module In this module, we cover What is a linear combination? Basic definitions and terminology.
Chapter 4: Linear Programming Sensitivity Analysis
1 Linear Programming Using the software that comes with the book.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
ARAPAHOE COMMUNITY COLLEGE MAT 121 COLLEGE ALGEBRA SOLVING SYSTEMS OF EQUATIONS IN TWO VARIABLES CHAPTER 6 SECTION 6.1 DIANA HUNT.
Linear Programming Optimal Solutions and Models Without Unique Optimal Solutions.
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Spreadsheet Modeling & Decision Analysis:
Please open your laptops, log in to the MyMathLab course web site, and open Daily Quiz 18. You will have 10 minutes for today’s quiz. The second problem.
Chapter 3 An Introduction to Linear Programming
Introduction Solving inequalities is similar to solving equations. To find the solution to an inequality, use methods similar to those used in solving.
Algebra 1 Ch 7.3 – Linear Systems by Combinations.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
4.1 Polynomial Functions Objectives: Define a polynomial.
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
Systems of Linear Equations
Introduction to Mathematical Programming OR/MA 504 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
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.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Lecture 11.5: Sensitivity Part III: Ranges AGEC 352 Fall 2012—October 22 R. Keeney.
Managerial Decision Making and Problem Solving
Slide 7- 1 Copyright © 2012 Pearson Education, Inc.
Chapter 4.1 Solving Systems of Linear Equations in two variables.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
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.
Linear Programming: Sensitivity Analysis and Interpretation of Solution Pertemuan 5 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
Sensitivity analysis LI Xiao-lei. A graphical introduction to sensitivity analysis Sensitivity analysis is concerned with how changes in an LP’s parameters.
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Chapter 8 Section 3 Solving System of Equations by the Addition Method.
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.
Solving Equations Using Addition and Subtraction A.4f Apply these skills to solve practical problems. A.4b Justify steps used in solving equations. Objectives.
Good Morning, We are moving on to chapter 3. If there is time today I will show you your test score you can not have them back as I still have several.
Constraints Feasible region Bounded/ unbound Vertices
Please CLOSE YOUR LAPTOPS, and turn off and put away your cell phones, and get out your note- taking materials.
CDAE Class 16 Oct. 18 Last class: 3. Linear programming and applications Quiz 4 Today: Result of Quiz 4 3. Linear programming and applications Group.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
Managerial Decision Modeling with Spreadsheets Chapter 4 Linear Programming Sensitivity Analysis.
Artificial Variable Technique (The Big-M Method) ATISH KHADSE.
Lecture 10: Sensitivity Part I: General
Systems of Linear Equations
Chap 10. Sensitivity Analysis
Section 3.4 Sensitivity Analysis.
6.3 Using Elimination to Solve Systems
Presentation transcript:

Lecture 10: Sensitivity Part I: General AGEC 352 Spring 2011 – February 28 R. Keeney

Exam Overview Average Score = 79 Median Score = 79 ◦ Range = ~40 Most missed question ◦ #19 – Answer is D because the line has a negative slope

Exam Overview Grading mistakes / errors in the exam ◦ If you put ‘FREE’ for number 7 or ◦ If you put False for number 14 ◦ Resubmit your exam at the end of class Other questions, see me after class ◦ Things to check  Did you miss the questions marked with X?  Are the X’s counted correctly?  Is your score = 100 – 3*(number of X’s)?

Exam Answers 1.A 2.C 3.True 4.True 5.D 6.C 7.A,B,D 8.True 9.True 10.B 11. B 12. False 13. A 14. True 15. B 16. C 17. False 18. False 19. D 20. True 21. A 22. D 23. True 24. True 25. True 26. False 27. C 28. B 29. True 30. True

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… ◦ Better off? Worse off? Indifferent? 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… ◦ Better off? Worse off? Indifferent? 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 ◦ Indifferent (Z is the same)