1 Linear Programming: Assumptions and Implications of the LP Model updated 18 January 2006 SMU EMIS 8374 Network Flows.

Slides:



Advertisements
Similar presentations
Computational Methods for Management and Economics Carla Gomes Module 2 (addendum) Revisiting the Divisibility Assumption (Textbook – Hillier and Lieberman)
Advertisements

Integer Optimization Basic Concepts Integer Linear Program(ILP): A linear program except that some or all of the decision variables must have integer.
Chapter 19 – Linear Programming
Introduction to Mathematical Programming
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Lesson 08 Linear Programming
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.
1 Chapter 11 Here we see cases where the basic LP model can not be used.
Linear Programming.
BA 452 Lesson B.3 Integer Programming 11ReadingsReadings Chapter 7 Integer Linear Programming.
Linear Programming – Sensitivity Analysis How much can the objective function coefficients change before the values of the variables change? How much can.
Linear Programming Models & Case Studies
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.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Linear Programming: Formulations & Graphical Solution.
In this handout Stochastic Dynamic Programming
19 Linear Programming CHAPTER
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 6 LP Assumptions.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India LINEAR PROGRAMMING GRAPHIC METHOD 2 CHAPTER.
Operations Management
Basic LP Problem McCarl and Spreen Chapter 2 LP problem is linear form of Mathematical Program This formulation may also be expressed in matrix notation.
Agenda Office Hours: Friday 2-3 Final: Friday 4pm - Sat. 4pm.
Linear Programming: Fundamentals
Linear Programming General Form of an LP Model. Linear Programming General Form of an LP Model where the c’s, a’s and b’s are constants determined from.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
LINEAR PROGRAMMING: THE GRAPHICAL METHOD
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
Linear Programming Models: Graphical and Computer Methods
FORS 4710 / 6710 Forest Planning FORS 8450 Advanced Forest Planning Lecture 2 Linear Programming.
1-1 Introduction to Optimization and Linear Programming Chapter 1.
Introduction to Linear Programming
Chapter 3 Introduction to Optimization Modeling
Linear Programming Sensitivity of the Objective Function Coefficients.
Product Mix Problem Monet company makes four types of frames.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Mathematical Programming Cht. 2, 3, 4, 5, 9, 10.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
Linear Programming Joseph Mark November 3, What is Linear Programming Linear Programming – a management science technique that helps a business.
3-1 Chapter 3 Aggregate Planning McGraw-Hill/Irwin Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
Chapter 6 Supplement Linear Programming.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 3 Basics of the Simplex Algorithm.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
1 The Geometry of Linear Programs –the geometry of LPs illustrated on GTC Handouts: Lecture Notes February 5, 2002.
Healthy Animals Curtis is concerned about the
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
LINEAR PROGRAMMING.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Example 1: The Absolute Value Function
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
2-1 Modeling with Linear Programming Chapter Optimal Solution for New Objective Function Graphical Solution of Maximization Model (12 of 12) Maximize.
1 Geometrical solution of Linear Programming Model.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
Linear Programming Technical Supplement 1 Linear Programming Copyright © 2014 by the McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin.
Linear Programming Topics General optimization model
Linear Programming – Introduction
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
Linear Programming Topics General optimization model
Section 6.2 Linear Equations in One Variable
Spreadsheet Modeling & Decision Analysis
Operations Research Models
Optimization Models Module 9.
Presentation transcript:

1 Linear Programming: Assumptions and Implications of the LP Model updated 18 January 2006 SMU EMIS 8374 Network Flows

2 Assumptions of the LP Model Proportionality –The contribution of any decision variable to the objective function is proportional to its value. –For example, in the diet problem, the contribution to the cost of the diet from one pound of apples is $0.75, $1.50 from two pounds of apples, $3.00 for four pounds, and $ for four hundred pounds. –In many cases, a volume discount is available whereby the price per pound goes down as more apples are purchased. Such discounts are often nonlinear which means that a linear programming model is either inappropriate or is really just an approximation of the real world.

3 Assumptions of the LP Model Additivity –The contribution to the objective function for any variable is independent of the other decision variables. For example in the NSC production problem, the production of P 2 tons of steel in Month 2 will always contribute $4000 P 2 regardless of how much steel is produced in Month 1.

4 Assumptions of the LP Model Proportionality and Additivity are also implied by the linear constraints. –In the diet problem, you can obtain 40 milligrams of protein for each gallon of milk you drink. It is unlikely, however, that you would actually obtain 4,000 milligrams of protein by drinking 100 gallons of milk. –Also, it may be the case due to a chemical reaction, you might obtain less than 70 milligrams of Vitamin A by combining a pound of cheese with a pound of apples.

5 Assumptions of the LP Model Divisibility –The LP model assumes that the decision variables can take on fractional variables. Thus, it allows for a solution to the GT Railroad problem that sends 0.7 locomotives from Centerville to Fine Place. In many situations, the LP is being used on a large enough scale that one can round the optimal decision variables up or down to the nearest integer and get an answer that is feasible and reasonably close to the optimal integer solution. –Divisibility also implies that the decision variables can take on the full range of real values. For example in the diet problem the LP may tell you to buy apples. For large problems, rounding or truncating of the optimal LP decision variables will not greatly affect the solution.

6 Assumptions of the LP Model Certainty –The LP model assumes that all the constant terms, objective function and constraint coefficients as well as the right hand sides, are know with absolute certainty and will not change. –If the values of these quantities are not known with certainty, for example if the demand data given in the NSC are forecasts that might not be 100% accurate, then this assumption is violated.