Linear Programming Example 4

Slides:



Advertisements
Similar presentations
Linear Programming.
Advertisements

Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
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.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Chapter 3 Linear Programming: Sensitivity Analysis and Interpretation of Solution MT 235.
Sensitivity analysis BSAD 30 Dave Novak
Example 3 Financial Model Rate of Return Summation Variable/Constraint
Linear Programming Building Good Linear Models And Example 1 Sensitivity Analyses, Unit Conversion, Summation Variables.
Chapter 4: Linear Programming Sensitivity Analysis
Linear Programming Example 4 Determining Objective Function Coefficients Interpretation of Shadow Prices Interpretation of Reduced Costs Ranges of Optimality/Feasibility.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Linear Programming Example 2 Alternate Optimal Solutions.
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.
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.
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.
Managerial Decision Making and Problem Solving
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor.
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor Case Study (Section 5.2)5.2 Changes in One Objective Function.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
To accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Fourth Edition  1996 Addison-Wesley Publishing Company, Inc. All rights.
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.
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.
Sensitivity Analysis Consider the CrossChek hockey stick production problem:   Management believes that CrossChek might only receive $120 profit from the.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 9 Intro to Sensitivity Analysis.
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
Sensitivity Analysis Consider the CrossChek hockey stick production problem: Management believes that CrossChek might only receive $120 profit from 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.
1 A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear constraints. The linear model consists of the.
1 Sensitivity Analysis (II). 2 Sensitivity Report.
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
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 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 3: Sensitivity Analysis and the Dual Problem & Shadow Prices
Linear Programming.
MID-TERM EXAM/REVISION
OPSM301 Spring 2012 Class11: LP Model Examples
Introduction to Linear Programs
St. Edward’s University
Chapter 5 Linear Inequalities and Linear Programming
Table of Contents Chapter 5 (What-If Analysis for Linear Programming)
Exam 1 Review/Instructions
MAN 305 OPERATIONS RESEARCH II Week 4 –Sensitivity Analysis with Spreadsheets DR. KAZIM BARIŞ ATICI.
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
ISS500E-Quantitiative Decision Tehniques
Duality Theory and Sensitivity Analysis
Sensitivity Analysis and
St. Edward’s University
Linear Programming SIMPLEX METHOD.
Linear Programming Building Good Linear Models And Example 1
Linear Programming Introduction.
Optimization Theory Linear Programming
Optimization Models Module 9.
Linear Programming Integer Linear Models.
Linear Programming Integer Linear Models.
Chapter 4 The Simplex Algorithm
Linear Programming Introduction.
Case 2:( Model Construction):
Integer Linear Programming
Presentation transcript:

Linear Programming Example 4 Determining Objective Function Coefficients Interpretation of Shadow Prices Interpretation of Reduced Costs Ranges of Optimality/Feasibility

The Problem A manufacturer of docking stations for computers can make three different styles from laminated wood. Each docking station requires 2 slide assemblies. Screws, braces and other hardware required to produce the docking stations are in abundant supply and will not affect production. Each week it can assign up to 6 workers working 8 hours per day, 5 days a week for production – sunk cost. Each week it can purchase up to 7500 sq. ft. of the laminated wood for $0.20 per sq. ft. 4500 slide assemblies for $0.40 each Station Wood Labor Cost of Selling Model Required Required Hardware Price SL 1 4 sq. ft 4.8 min. $0.75 $11.35 CP 6 3 sq. ft. 6.6 min. $0.90 $12.30 JR 8 2.5 sq. ft. 7.2 min. $1.10 $14.40

Questions What is the optimal production schedule and weekly profit? If 150 extra slide assemblies became available, what is the most you would be willing to pay for them? If a half-time worker could be added to the labor force, what is the most we would be willing to pay him. If an additional full-time worker were added why would the shadow prices change? What is the minimum selling price for the CP 6 model that would justify its production? Within what range of values for the net profit of JR 8’s will the optimal solution remains the same?

Decision Variables/Objective Net Weekly Unit Profit (Selling Price) – (Hardware Cost) (Slide Cost) – (Wood Cost) X1 = # SL 1’s produced weekly X2 = # CP 6’s X3 = # JR 8’s $11.35 - .75 – 2(.40) – 4(.20) = $9.00 $12.30 - .90 – 2(.40) – 3(.20) = $10.00 $14.40 - 1.10 – 2(.40) – 2.5(.20) = $12.00 MAX Total Expected Weekly Return MAX Total Expected Weekly Return MAX 9X1 + 10X2 + 12X3

Constraints Cannot use more than 7500 feet of wood Cannot use more than 4500 slide assem. Cannot use more than (6 workers)x(8hr/day) x(5 days/week)x(60min/hr) = 14,400 min Feet of wood used Cannot Exceed 7500 4X1 + 3X2 + 2.5X3 7500 ≤ Slide Assemblies Used Cannot Exceed 4500 2X1 + 2X2 + 2X3 4500 ≤ Minutes Used Cannot Exceed 14400 4.8X1 + 6.6X2 + 7.2X3 ≤ 14400

Complete Model MAX 9 X1 + 10 X2 + 12X3 s.t. 4 X1 + 3 X2 + 2.5X3 ≤ 7500 All X’s ≥ 0

=SUMPRODUCT($C$3:$E$3,C10:E10) =C5-C6-C7-C8 Drag across =.2*C11 Drag across =SUMPRODUCT($C$3:$E$3,C10:E10) Drag down

What is the optimal production schedule and weekly profit? Sl 1’s 0 CP 6’s 1500 JR 8’5 $24,750 Weekly Profit

If 150 extra slide assemblies became available, what is the most you would be willing to pay for them? Shadow price = 1.5 150 is within the Allowable Increase Slide assemblies are included costs. Value Per Unit = Original Price + Shadow Price = .40 +1.50 = 1.90 150 units Worth 150(1.90) = $285

If a half-time worker could be added to the labor force, what is the most we would be willing to pay him. ½ time worker works (4)(5)(60) =1200 minutes per week Shadow price = 1.25 1200 is within the Allowable Increase Labor is a sunk cost. 1200 minutes Worth 1200(1.25) = $1500

If an additional full-time worker were added why would the shadow prices change? Full time worker works (8)(5)(60) =2400 minutes per week 2400 is outside the Allowable Increase Thus the shadow prices will change.

What is the minimum selling price for the CP 6 model that would justify its production? Reduced Cost = -1.25 Profit and hence the selling price would have to improve by $1.25 Thus selling price must rise to $12.30 + 1.25 = $13.55

Within what range of values for the net profit of JR 8’s will the optimal solution remains the same? Range of Optimality 12 – 1.67  12 + 1.50 $10.33  $13.50

Review How to calculate “net” objective function coefficients. How to interpret the shadow price of an included cost. How to interpret a shadow price of a sunk cost. How to interpret a reduced cost. How to use a range of feasibility. How to use a range of optimality.