Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.1 Chapter 12 Planning with linear programming.

Slides:



Advertisements
Similar presentations
Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a mn *X n  b m X 1, X n  0 Standard form.
Advertisements

Linear Programming Problem
Lecture 3 Linear Programming: Tutorial Simplex Method
Planning with Linear Programming
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.
Linear Programming Sensitivity of the Right Hand Side Coefficients.
BA 452 Lesson A.2 Solving Linear Programs 1 1ReadingsReadings Chapter 2 An Introduction to Linear Programming.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Introduction to Management Science
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
1 Linear Programming Using the software that comes with the book.
Eg Al is buying some cows and sheep for his farm. He buys c cows at £120 each He buys s sheep at £200 each. He wants at least 10 animals in total. He wants.
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.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
D1: Linear Programming.
Spreadsheet Modeling & Decision Analysis:
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
3-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
Introduction to Mathematical Programming OR/MA 504 Chapter 3.
Chapter 15 Constrained Optimization. The Linear Programming Model Let : x 1, x 2, x 3, ………, x n = decision variables Z = Objective function or linear.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Special Conditions in LP Models (sambungan BAB 1)
Introduction to Management Science
Chapter Topics Computer Solution Sensitivity Analysis
1 1 Slide © 2005 Thomson/South-Western Slides Prepared by JOHN S. LOUCKS ST. EDWARD’S UNIVERSITY.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
___________________________________________________________________________ Operations Research  Jan Fábry Linear Programming.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry Linear Programming.
Chapter 6 Supplement Linear Programming.
Chapter 6 Linear Programming: The Simplex Method Section R Review.
Chapter 7 Introduction to Linear Programming
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
3-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Linear Programming: Computer Solution and Sensitivity Analysis Chapter 3.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
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.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Notes on Linear Programming Uwe A. Schneider. Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a.
1 1 Slide © 2005 Thomson/South-Western MANAGMENT SCIENCE n Chapter 1: Introduction Problem solving and decision making; quantitative analysis and decision.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Sensitivity analysis continued… BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12 th edition – some slides are directly.
Chapter 3 Profit and costs1 CHAPTER 3 Profit maximisation, input demand, output supply and duality.
Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Chapter 8 of Quantitative Methods for Business by Anderson, Sweeney and Williams Read sections 8.1, , 8.4 (omitting “Simultaneous Changes”), 8.5,
Linear Programming Graphical Solution. Graphical Solution to an LP Problem This is easiest way to solve a LP problem with two decision variables. If there.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
1 Introduction to Linear Programming Linear Programming Problem Linear Programming Problem Problem Formulation Problem Formulation A Simple Maximization.
Managerial Decision Modeling with Spreadsheets Chapter 4 Linear Programming Sensitivity Analysis.
MIT and James Orlin © The Geometry of Linear Programs –the geometry of LPs illustrated on GTC.
Linear Programming.
Linear Programming: Sensitivity Analysis and Duality
Introduction to linear programming (LP): Minimization
Sensitivity.
Linear Programming Problem
Linear Programming: Computer Solution and Sensitivity Analysis
Presentation transcript:

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.1 Chapter 12 Planning with linear programming

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.2 After finishing this chapter you should be able to: Appreciate the concept of constrained optimisation Describe the stages in solving a linear programme Formulate linear programmes and understand the assumptions Use graphs to solve linear programmes with two variables Calculate marginal values for resources Calculate the effect of changing an objective function Interpret printouts from computer packages.

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.3 Linear programming is a way of solving some problems of constrained optimisation Constrained optimisation has: – an aim of optimising – either maximising or minimising – some objective. – a set of constraints that limit the possible solutions.

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.4 There are three distinct stages in solving a linear programme: formulation – getting the problem in the right form solution – finding an optimal solution to the problem sensitivity analysis – seeing what happens when the problem is changed slightly.

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.5 Formulation contains decision variables an objective function a set of constraints a non-negativity constraint. Formulating the problem is generally the most difficult part, as it can need considerable skills.

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.6 Finding a solution needs a lot of repetitive arithmetic This is always done by computer. We can illustrate the general approach with a graph for two variables. Figure 12.5 Superimposing the objective function on the feasible region

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.7 The feasible region is convex. The optimal solution is always at an extreme point of the feasible region. The objective function identifies the optimal point. At the optimal solution some constraints are limiting, and others have a slack. Formal procedures to find optimal solutions are based on the simplex method.

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.8 Sensitivity analysis finds what happens to the solution when Resources change The objective function changes

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide 12.9 Changes to resources Here shadow prices show the value of each additional unit of resource. Then each additional unit of resource increases the objective function by the shadow price. For small changes the optimal solution remains at the same extreme point. Shadow prices are only valid within certain limits before the optimal solution moves to another extreme point.

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Changes to the objective function When the coefficients in the objective function change, its gradient changes. We can calculate the effects of these on the optimal solution. For small changes, the optimal solution remains at the same extreme point. For larger changes, the optimal solution moves to another extreme point.

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.1 Production problem for Growbig and Thrive

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.2 Graph of the blending constraint

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.3 Graph of the three constraints defining a feasible region

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.4 Profit lines for Growbig and Thrive

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.6 Moving the objective function line as far as possible away from the origin identifies the optimal solution

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.7 Identifying the optimal solution for worked example 12.4

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.8 Printout for the Growbig and Thrive problem

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure 12.9 Using ‘Solver’ for a linear programme

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure Output from a LP package for worked example 12.6

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure Graph of solution for Amalgamated Engineering, worked example 12.6

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure Printout for West Coast Wood Products, worked example 12.7

Donald Waters, Quantitative Methods for Business, 4 th Edition © Donald Waters 2008 Slide Figure Printout for problem 12.6