Lecture 8: Optimization with a Min objective AGEC 352 Spring 2012 – February 8 R. Keeney.

Slides:



Advertisements
Similar presentations
office hours: 3:45PM to 4:45PM tuesday LUMS C85
Advertisements

Consumer’s and Producer’s Surpluses
Understanding optimum solution
LIAL HORNSBY SCHNEIDER
Linear Programming – Simplex Method
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
PPA 723: Managerial Economics
Chapter 2: Modeling with Linear Programming & sensitivity analysis
CCMIII U2D4 Warmup This graph of a linear programming model consists of polygon ABCD and its interior. Under these constraints, at which point does the.
1 Q: Why is the tangent point special?. 2 A: It gives us a short cut.
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.
Chapter 7 LINEAR PROGRAMMING.
The Simplex Method: Standard Maximization Problems
Operation Research Chapter 3 Simplex Method.
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 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.
Lecture 1: Basics of Math and Economics AGEC 352 Spring 2011 – January 12 R. Keeney.
Chapter 4: Linear Programming Sensitivity Analysis
1 Linear Programming Using the software that comes with the book.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
ECON 1150, Spring 2013 Lecture 3: Optimization: One Choice Variable Necessary conditions Sufficient conditions Reference: Jacques, Chapter 4 Sydsaeter.
Applied Economics for Business Management
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
LINEAR PROGRAMMING SIMPLEX METHOD.
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
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.
Chapter 6 Production. ©2005 Pearson Education, Inc. Chapter 62 Topics to be Discussed The Technology of Production Production with One Variable Input.
Lecture 11.5: Sensitivity Part III: Ranges AGEC 352 Fall 2012—October 22 R. Keeney.
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to two  constraints.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Modelling the producer: Costs and supply decisions Production function Production technology The supply curve.
Chapter 7 Duality and Sensitivity in Linear Programming.
Linear Programming – Simplex Method
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
Microeconomics Pre-sessional September 2015 Sotiris Georganas Economics Department City University London.
Lecture 8 Profit Maximization. Comparison of consumer theory with producer theory In consumer theory we learned that the main objective of consumer is.
Econ 201 May 7, 2009 Indifference Curves Budget Lines and Demand Curves 1.
Utility: A Measure of the Amount of SATISFACTION A Consumer Derives from Units of a Good Chapter 5: Utility Analysis.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Example 3.2 Graphical Solution Method | 3.1a | a3.3 Background Information n The Monet Company produces two type of picture frames, which.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
3.4: Linear Programming  Intro: Oftentimes we want to optimize a situation - this means to:  find a maximum value (such as maximizing profits)  find.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
Chapter Four Consumer Choice Chapter Four. Chapter Four Consumer Choice Chapter Four.
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.
Section 3.5 Linear Programing In Two Variables. Optimization Example Soup Cans (Packaging) Maximize: Volume Minimize: Material Sales Profit Cost When.
Production & Costs Continued…
Lecture 10: Sensitivity Part I: General
Last class: Today: Next class: Important dates:
Chapter 6 Production.
LINEAR PROGRAMMING.
Modelling the producer: Costs and supply decisions
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Graphical Analysis – the Feasible Region
Graphical Sensitivity Analysis and Computer Solution
1.6 Linear Programming Pg. 30.
Presentation transcript:

Lecture 8: Optimization with a Min objective AGEC 352 Spring 2012 – February 8 R. Keeney

Upcoming Today: Minimization lecture Next Week (Week 6) ◦ 2/13: Quiz on lecture 4-8; review HW 3 ◦ 2/14: Lab on Minimization ◦ 2/15: Sensitivity Week 7 ◦ 2/20: Exam Review in Class (Assignment) ◦ 2/21: No lab, Office Hrs from 9-12 ◦ 2/22: Exam I (50 mins., 30 ?’s, MC & T/F)

Profits as the objective Profit has been used so far as our objective variable and we assumed that this variable should be maximized What if our problem has no revenue? ◦ Max P = R – C  R = 0 then  Max P = -C We could maximize profits by finding the maximum of the negative of costs. Or…

Just treat Cost as the objective variable Max –C Min C ◦ These two are equivalent. Any minimization problem can be rewritten as a maximization of the negative of the objective variable. Given this relationship, we should expect everything about a basic minimization problem to be opposite (negative) of our basic maximization problem.

Comparison of 2 variable problems *Objective = max --better off with higher values of the objective variable *Constraints are upper limits --having higher resource levels increases the maximum making us better off *Objective = min --better off with lower values of the objective variable *Constraints are lower limits --having higher requirement levels increases the minimum making us worse off

Constraint Analysis We found the ‘most limiting resource’ in maximization problems ◦ Divide RHS by coefficient for an activity and choose the smallest Now we can find the ‘most limiting requirement’ ◦ Divide the RHS by coefficient for an activity and choose the largest Graphically…

Most limiting requirement Cereal A RequirementSupplied by Cereal A Total required Total/ required Thiamine Niacin Calories If we were only going to eat cereal A, we would have to eat 10 ounces to fulfill the Thiamine requirement.

Most limiting requirement Cereal B RequirementSupplied by Cereal B Total required Total/ required Thiamine Niacin Calories If we were only going to eat cereal B, we would have to eat 20 ounces to fulfill the Niacin requirement.

Some things we know just from the constraints Feasible space graph ◦ Cereal A axis intersects at A = 10 ◦ Cereal B axis intersects at B = 20 The cereals have different most limiting requirements, a mixture of the two cereals is very likely to be cheaper than eating only one Calories is not the most limiting resource for either food. It should not bind in the optimal solution…

Feasible space of a maximization problem (see lecture for Jan. 25) Feasible space is inside of the lines.

Feasible space of the cereal mix minimization problem *Feasible space is everything northeast of the lines. *Completely defined by Thiamine and Niacin. *Three corner points: A=0 & B=20 A=10 & B=0 A=4.4 & B=2.2

The Objective (Level Curve) Price of Cereal A = 3.8 Price of Cereal B = 4.2 C = 3.8A B ◦ Rewrite this isolating B (the y-axis variable) B = C/4.2 – (3.8/4.2)A ◦ Cost measured in units of Cereal B  Intercept is determined by C, so we want the lowest intercept  Slope converts A to units of B

Model with Level Curves *Lower intercepts indicate lower costs *Objective is improving when we lower the intercept due to minimization *Cost = 20 is not feasible (no point gives both enough thiamine and niacin) *Cost = 30 is feasible but is not optimal.

Back to economics This is an expenditure minimization model ◦ Similar to the utility problem faced by consumers. ◦ What is the cheapest way to reach a target level of satisfaction. ◦ Indifference curves and an isoexpenditure line… Also the input-input model of producer problems that use isoquants.

Economic Model X1 X2 U = target level *Expenditures decrease in this direction but must be large enough to meet the target utility. *Optimum is the tangency point.

Basic versus Non-basic models Basic models have only one type of constraint ◦ Maximization  <= constraints ◦ Minimization  => constraints More realistic models will have more options and may have both types of constraints…

Calories in the cereal problem What if we cared about both ◦ Eating enough calories and ◦ Not eating too many calories How would we model this?

Algebraic Model Extended

New Feasible Space Feasible Space is the triangle between Niacin, Thiamine, and Max Cal constraints.