QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.

Slides:



Advertisements
Similar presentations
1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
Advertisements

LINEAR PROGRAMMING (LP)
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
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.
Linear Programming.
Linear Programming Problem
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
SENSITIVITY ANALYSIS.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Operations Management Linear Programming Module B - Part 2
LP EXAMPLES.
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Chapter 4: Linear Programming Sensitivity Analysis
QM B Linear Programming
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Linear Programming OPIM 310-Lecture 2 Instructor: Jose Cruz.
To Accompany Krajewski & Ritzman Operations Management: Strategy and Analysis, Seventh Edition © 2004 Prentice Hall, Inc. All rights reserved. Linear Programming.
Linear Programming: Computer Solution and Sensitivity Analysis
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Goals and aims To introduce Linear Programming To find a knowledge on graphical solution for LP problems To solve linear programming problems using excel.
© Copyright 2004, Alan Marshall 1 Lecture 1 Linear Programming.
Linear Programming Chapter 14 Supplement. Lecture Outline Model Formulation Graphical Solution Method Linear Programming Model Solution Solving Linear.
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.
3.4 Linear Programming.
3-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
Linear Programming Chapter 13 Supplement.
Chapter Topics Computer Solution Sensitivity Analysis
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Table of Contents Chapter 5 (What-If Analysis for Linear Programming) Continuing the Wyndor.
___________________________________________________________________________ Operations Research  Jan Fábry Linear Programming.
Table of Contents Chapter 6.8 (Sensitivity Analysis with Solver Table) Continuing the Wyndor Case Study Changes in One Objective Function Coefficient Simultaneous.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry Linear Programming.
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.
Business Mathematics Rétallér Orsi.
Operations Research I IE 416 California State Polytechnic University, Pomona Operations Research I IE 416 California State Polytechnic University, Pomona.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
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 Max 8X 1 + 5X 2 (Weekly profit) subject to 2X 1 + 1X 2  1000 (Plastic) 3X 1 + 4X 2  2400 (Production Time) X 1 + X 2  700 (Total production) X 1.
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
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 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Lecture 8 Integer Linear Programming
OPSM 301 Operations Management Class 13&14: Linear Programming using Excel Koç University Zeynep Aksin
OPSM 301 Operations Management Class 11: Linear Programming using Excel Koç University Zeynep Aksin
LINEAR PROGRAMMING 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1n X n
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
Chapter 3: Sensitivity Analysis and the Dual Problem & Shadow Prices
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming.
Ardavan Asef-Vaziri Systems and Operations Management
Introduction to Linear Programs
Chapter 5 Simplex-Based Sensitivity Analysis and Duality
Duality Theory and Sensitivity Analysis
Section 3.4 Sensitivity Analysis.
Case 2:( Model Construction):
Presentation transcript:

QM B Lego Simplex

Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick

Lego Simplex Data Table –2 large bricks –2 small bricks –$16 profit Chair –1 large bricks –2 small bricks –$10 profit

Lego My Simplex Resources You have 8 small bricks and 6 large bricks

The Goal How many tables and how many chairs should be produced to maximize profit? Buzz Group Question 1 Groups of 3-4

One possible solution Is this solution optimal? Profit = 3*16 = $48 Give up a table (-$16) Make two chairs (+20) Improves the solution by $4. So the above solutions is not optimal.

Optimal Solution 2 tables 2 chairs Profit: $52

Formulate as an LP Buzz Group: Question 2 Be sure to: Define variables Write the objective function Write the constraints Include non-negativity constraints

Formulate as an LP T – number of tables to produce C – number of chairs to produce Max 16 T + 10 C Subject to: 2 T + C  6Large bricks 2 T + 2 C  8Small bricks T  0, C  0Non-negativity

Graphical Insight 2 T + C  6 2 T + 2 C  8

At the optimal solution: What if one more large brick becomes available? Buzz Group: Question 3

What would you be willing to pay for the brick? Pay a maximum of $6. This is the shadow price for large bricks – the increase in the objective function if one more unit of the resource, large bricks, becomes available. Take a chair apart: (-10) Make a table:(+16)

How many large bricks should you buy at $6? If we have yet another additional large bricks (8 altogether), then we can take apart the second chair and make a table. ($6 improvement). If we add one more large brick (9 altogether), can we make another table?

Allowable increase The number of additional large bricks that are worth the shadow price of $6 is 2.

Sensitivity Analysis Shadow Prices – increase in the objective function if one more unit of the resource becomes available Allowable increases – amount that the resource can increase and have the shadow price stay the same; –if outside the allowable increase, change RHS and re-run.

Sensitivity Report

Think-pair-share: Stratton – Sensitivity Analysis What is the optimal product mix? What is the unused capacity of each resource? An additional labor hour is available. Where should that labor hour be assigned? An additional 8 labor hours are available. Where should these labor hours be assigned? The material manager has found an additional 2 pounds of additive mix for $1.20 per pound. Should he procure this additional mix?

Stratton Sensitivity Analysis What is the optimal product mix 3 packages of Pipe 1 6 packages of Pipe 2 What is the unused capacity of each resource: Extrusion hours:0 hours Packaging hours:0 hours Additive mix:4 pounds

Stratton Sensitivity Analysis An additional labor hour is available, where should that labor hour be assigned? Packaging – for every additional hour of packaging, profit increases $11 (up to a 2 hours increase)

Stratton Sensitivity Analysis An additional 8 labor hours are available. Where should these labor hours be assigned? Need to re-run the model since 8 hours is larger than the allowable increase for both labor hour constraints.

Stratton Sensitivity Analysis The material manager has found an additional 2 pounds of additive mix for $1.20 per pound. Should he procure this additional mix? No, the current optimal solution does not use all of the additive mix that is available.