Lecture 12: Sensitivity Examples (Shadow Price Interpreted) AGEC 352 Spring 2012 – February 29 R. Keeney.

Slides:



Advertisements
Similar presentations
Lecture 14: Diet Problem/Intro to Final Project AGEC 352 Spring 2011 – March 21 R. Keeney.
Advertisements

Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
LINEAR PROGRAMMING SENSITIVITY ANALYSIS
IENG442 LINGO LAB3.
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.
The Diet Problem, And Inventory Holding Over Time Periods
OPSM 301 Operations Management
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
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.
Chapter 5 LP formulations. LP formulations of four basic problem Resource allocation problem Transportation problem Feed mix problem Joint products problem.
Section 3: Elasticity of Demand What Is Elasticity of Demand?
Linear Programming Sensitivity of the Right Hand Side Coefficients.
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.
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.
Lecture 18: Topics Integer Program/Goal Program AGEC 352 Spring 2011 – April 6 R. Keeney.
Lecture 8: LP in Excel (Review Assign. 1) AGEC 352 Spring 2011 – February 14 R. Keeney.
Lecture 12: Transportation Introduction AGEC 352 Spring 2011 – March 7 R. Keeney.
Lecture 11: Sensitivity Part II: Prices AGEC 352 Spring 2011 – March 2 R. Keeney.
1 Chapter 6 Sensitivity Analysis and Duality PART 3 Mahmut Ali GÖKÇE.
Who Wants to be an Economist? Part II Disclaimer: questions in the exam will not have this kind of multiple choice format. The type of exercises in the.
Chapter 4: Linear Programming Sensitivity Analysis
Finance 510: Microeconomic Analysis
Pet Food Company A pet food company wants to find the optimal mix of ingredients, which will minimize the cost of a batch of food, subject to constraints.
Finance 510: Microeconomic Analysis
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
PERFECTLY COMPETITIVE MARKET STRUCTURE AGR 130 Introduction to Agricultural Economics Murray State University.
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Linear Programming.
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 Chapter 4 Application on Demand and Supply. 2 Elasticity Elasticity is a general concept that can be used to quantify the response in one variable when.
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
Linear Programming Chapter 13 Supplement.
Robert Delgado Chris Mui Amanda Smith Presented to: Dr. Sima Parisay Due: October 20 th, 2011 California State Polytechnic University, Pomona.
Chapter 5 What is Supply?. Bell ringer Transparency 14.
Supply and Demand Chapter 3 Copyright © 2011 by The McGraw-Hill Companies, Inc. All Rights Reserved.McGraw-Hill/Irwin.
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.
Lecture 6 Producer Theory Theory of Firm. The main objective of firm is to maximize profit Firms engage in production process. To maximize profit firms.
Lecture 11.5: Sensitivity Part III: Ranges AGEC 352 Fall 2012—October 22 R. Keeney.
Managerial Decision Making and Problem Solving
Types of IP Models All-integer linear programs Mixed integer linear programs (MILP) Binary integer linear programs, mixed or all integer: some or all of.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Chapter 7 Duality and Sensitivity in Linear Programming.
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 © 2005 Thomson/South-Western Simplex-Based Sensitivity Analysis and Duality n Sensitivity Analysis with the Simplex Tableau n Duality.
CH 5.1 Supply Law of Supply Supply Curve Elasticity of supply Law of Supply Supply Curve Elasticity of supply.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Lecture 8: Optimization with a Min objective AGEC 352 Spring 2012 – February 8 R. Keeney.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Lecture 13: Transportation Introduction AGEC 352 Spring 2012 – March 5 R. Keeney.
1 Theory of the firm: Profit maximization Theory of the firm: Profit maximization.
SUPPLEMENTAL READING: CHAPTER 5.3 AND 5.4 Overheads 4 Different types of LP Formulations Part 1: The Transportation Model The Feed Mix Model 1.
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.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Chapter 3 Introduction to Linear Programming to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c)
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Lecture 10: Sensitivity Part I: General
Presentation transcript:

Lecture 12: Sensitivity Examples (Shadow Price Interpreted) AGEC 352 Spring 2012 – February 29 R. Keeney

Shadow Price signs  Signs on shadow prices differ whether the inequality constraint is ≤ or ≥.  They also differ for maximization and minimization problems. MaximizationMinimization ≤PositiveNegative ≥ Positive

Less than (<=) case A boundary that is <= (upper bound) We use +1 definition of shadow price ◦ The +1 will always ‘relax’ the upper bound A decision maker facing a less restrictive choice set ◦ Can be better off (binding constraint) ◦ Can be unaffected (slack constraint) Better off depends on max vs. min

Great than (>=) case A boundary that is >= (lower bound) We use +1 definition of shadow price ◦ The +1 will always ‘tighten’ a lower bound A decision maker facing a more restrictive choice set ◦ Can be worse off (binding constraint) ◦ Can be unaffected (slack constraint) Better off depends on max vs. min

Example (Upper/Max) Upper bound ◦ Maximization ◦ Land available to plant  Shadow price = the change in returns generated by a +1 to the land constraint  Shadow price = Maximum rent that can be paid  Use extra profits from additional resources to acquire the resource

Example (Upper/Min) Upper bound Minimization ◦ Fertilizer mix phosphate limit ◦ Shadow price = the change in costs from a 1 unit increase in the phos limit ◦ Shadow price = discount the mixer could offer to the buyer to expand the phos limit  Pass some of cost savings to buyer

Example (Lower/Max) Lower bound Maximization ◦ Every 10 acres of corn planted requires 1 acre left fallow (set aside)  Shadow price = change in profits from increasing set-aside by 1  Shadow price = payment farmer must receive to participate

Example (Lower/Min) Lower bound Minimization ◦ Calcium requirement in a daily diet  Shadow price = change in cost of requiring an extra unit of calcium  Shadow price = maximum price that can be paid per unit of non-food calcium supplement

Lab Assignment Problem 4 Fertilizers (see lab 5 for fertilizer info) ◦ Different compositions of nitrogen, potash, and phosphate ◦ Meet an order (at minimum cost) by mixing the four fertilizers that has:  Exactly 1000 units of fertilizer  At least 20% (by weight) nitrogen  At least 30% (by weight) potash  At most 8% (by weight) phosphate

Shadow Prices in Fert. Problem Fertilizer Component LHSRHSShadow Price Nitrogen201.3>= Potash300.0>= Phosphate80.0<= Total Weight1000=

Interpretation of Potash  Potash constraint  Required to have a minimum amount of potash in the fertilizer mix  Increasing the RHS of the potash constraint makes the problem more restrictive, higher percentage of potash required  Shadow price is positive because costs will increase with the increase of RHS  Interpret this as the amount we would be willing to pay to avoid having the RHS increase  Also, the discount we could offer for a mix that had 0.1% less potash content

Interpretation Phosphate  Phosphate constraint  Upper limit on the phosphate content  Increasing the RHS of the phosphate constraint makes the problem less restrictive, higher percentage of phosphate allowed  Shadow price is negative because costs will decrease with the increase of RHS  Interpret this as the amount we would be willing to pay to relax the RHS by one unit  Also, the markup we should charge if someone required 0.1% less phosphate in their fertilizer mix

Interpretation in general Always should be in context of the problem ◦ Signs are actually trivial if you understand the problem (better off/worse off) ◦ Does an increase in the RHS improve or worsen the objective?  If it improves, then we know the willingness to pay for increasing the RHS  If it worsens, then we know the willingness to pay to avoid having the RHS increase

Advanced Analysis: Which constraint is the most costly? Recall the cereal problem from lecture ◦ Two cereals mixed to meet minimum requirements on thiamine, niacin, and calcium Nutritional Requirement LHSRHSShadow Price Thiamine1>= Niacin5>= Calories722.2>=

Rather than comparing units, we want to compare % of RHS 1 mg of thiamine and 1 mg of niacin are not directly comparable % increases in the RHS of constraints are however Nutritional Requirement RHS1 % increase Shadow Price SP * 1% increase Thiamine Niacin Calories

Ranking the constraints  Thiamine was the most costly constraint to meet  We would have judged this the same just comparing shadow prices, but that could be misleading  Similar to elasticity interpretations  Elasticity of demand for food versus cars  Requires that you understand the problem and interpretation to make the comparisons

Fertilizer Problem Consider ◦ Is total comparable to others? ◦ How to deal with positive vs negative shadow prices?  Compare relaxations of constraints…

Common percentage and direction (of objective variable) Cost saving, 1% change in K ◦ Total cost reduces $30.00 Cost saving, 1% change in P ◦ Total cost reduces by $11.20

Planting Problem Shadow price for land is 2X labor ◦ 1 unit of land is usually worth more than a unit of labor Compare them as 1% increase in our resource base (labor > land > allot)