LP EXAMPLES.

Slides:



Advertisements
Similar presentations
QingPeng (QP) Zhang  Sensitivity analysis is concerned with how changes in an linear programming’s parameters affect the optimal.
Advertisements

LINEAR PROGRAMMING SENSITIVITY ANALYSIS
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.
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.
Sensitivity Analysis Sensitivity analysis examines how the optimal solution will be impacted by changes in the model coefficients due to uncertainty, error.
Linear Programming Sensitivity of the Right Hand Side Coefficients.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
IENG313 Operation Research I
SENSITIVITY ANALYSIS.
Lecture 12: Sensitivity Examples (Shadow Price Interpreted) AGEC 352 Spring 2012 – February 29 R. Keeney.
19 Linear Programming CHAPTER
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
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.
Sensitivity analysis BSAD 30 Dave Novak
Chapter 4: Linear Programming Sensitivity Analysis
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Programming: Fundamentals
1 Linear Programming Using the software that comes with the book.
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Linear Programming.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Spreadsheet Modeling & Decision Analysis:
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
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.
Computational Methods for Management and Economics Carla Gomes
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
The application of mathematics and the scientific
Linear Programming Chapter 13 Supplement.
Special Conditions in LP Models (sambungan BAB 1)
Readings Readings Chapter 3
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.
Presentation: H. Sarper
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
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.
Managerial Decision Making and Problem Solving
1 Chapter 10 The primal linear program solution answers the tactical question when it tells us how much to produce. But the dual can have far greater impact.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Chapter 6 Supplement Linear Programming.
To accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Fourth Edition  1996 Addison-Wesley Publishing Company, Inc. All rights.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
A model consisting of linear relationships representing a firm’s objective and resource constraints Linear Programming (LP) LP is a mathematical modeling.
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 © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
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
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
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.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
P RIMAL -D UAL LPP. T HE R EDDY M IKKS C OMPANY - PROBLEM Reddy Mikks company produces both interior and exterior paints from two raw materials, M 1 and.
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.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Chapter 3: Sensitivity Analysis and the Dual Problem & Shadow Prices
Chapter 5 Sensitivity Analysis: An Applied Approach
The application of mathematics and the scientific
Duality Theory and Sensitivity Analysis
Sensitivity.
Linear Programming – Sensitivity Analysis
Applied Statistical and Optimization Models
Presentation transcript:

LP EXAMPLES

Gillian’s Restaurant CHP.2 Problem 34 & 35 Two products, ice cream and yogurt The freezer capacity is at most 115 gallons. A gallon of ice cream costs $0.93 and a gallon of frozen yogurt costs $0.75. Restaurant budgets $90 each week for these products. The demand for ice cream is at least twice of the demand for frozen yogurt. Profit per gallon of ice cream and yogurt are $4.15 and $3.60 , respectively.

Sensitivity Analysis REDUCED COST A decision variable with a positive value in the optimum solution will generally have zero reduced cost. Likewise, a decision variable with value zero in the optimum solution will have a non-zero reduced cost. The value of reduced cost gives the amount by which the objective function coefficient of this variable must change for this variable to have a non-zero value in the optimal solution

SENSITIVITY ANALYSIS SHADOW PRICE (DUAL VALUE) It is the marginal value of increasing the right-hand side of any constraint. binding constraints have zero slack or zero surplus and vice versa. Shadow price for not binding constraints is zero. Lower and upper bounds given for each constraint provide the range over which the shadow price for that constraint is valid.

SENSITIVITY ANALYSIS Dual Value RHS max Z (Profit) min Z (Cost) Positive increase increase decrease Positive decrease decrease increase Negative increase decrease increase Negative decrease increase decrease Note: As long as increases/decreases in RHSs are within the given lower and upper bounds

EXAMPLE 1 Tucker Inc. needs to produce 1000 Tucker automobiles. The company has four production plants. Due to differing workforces, technological advances, and so on, the plants differ in the cost of producing each car. They also use a different amount of labor and raw material at each. This is summarized in the following table: Plant Cost ('000) Labor Material 1 15 2 3 2 10 3 4 3 9 4 5 4 7 5 6 The labor contract signed requires at least 400 cars to be produced at plant 3; there are 3300 hours of labor and 4000 units of material that can be allocated to the four plants.

Questions for Example 1 1. What is the optimum solution? What is the current cost of production? 2. How much will it cost to produce one more vehicle? How much will we save by producing one less? 3. How would our solution change if it costs only $8,000 to produce at plant 2? 4. For what ranges of costs is our optimal solution (except for the objective value) valid for plant 2? 5. How much are we willing to pay for one more labor hour?

Questions for Example 1 6. What would be the effect of reducing the 400 car limit down to 200 cars? To 0 cars? What would be the effect of increasing it by 100 cars? by 200 cars? 7. How much is our raw material worth (to get one more unit)? How many units are we willing to buy at that price? What will happen if we want more?