1 DSCI 3023 Linear Programming Developed by Dantzig in the late 1940’s A mathematical method of allocating scarce resources to achieve a single objective.

Slides:



Advertisements
Similar presentations
IENG313 Operation Research I
Advertisements

Optimization problems using excel solver
Linear Programming Problem
Chapter 19 – Linear Programming
LINEAR PROGRAMMING (LP)
Introduction to Mathematical Programming
Linear Programming Problem. Introduction Linear Programming was developed by George B Dantzing in 1947 for solving military logistic operations.
Lesson 08 Linear Programming
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming.
Linear Programming Problem
Dragan Jovicic Harvinder Singh
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
Linear Programming Using the Excel Solver
19 Linear Programming CHAPTER
Operations Management
Introduction to Management Science
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.
QM B Linear Programming
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
Linear and Integer Programming Models
6s-1Linear Programming CHAPTER 6s Linear Programming.
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved by Prentice-Hall, Inc1  Model.
1 Lecture 2 & 3 Linear Programming and Transportation Problem.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Introduction to Management Science
Linear Programming: Model Formulation and Graphical Solution
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Linear-Programming Applications
FORMULATION AND GRAPHIC METHOD
Linear programming. Linear programming… …is a quantitative management tool to obtain optimal solutions to problems that involve restrictions and limitations.
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Chapter 19 Linear Programming McGraw-Hill/Irwin
Linear Programming Chapter 13 Supplement.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J B-1 Operations.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
STDM - Linear Programming 1 By Isuru Manawadu B.Sc in Accounting Sp. (USJP), ACA, AFM
1 Linear Programming: Model Formulation and Graphical Solution.
Chapter 6 Supplement Linear Programming.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
BUSINESS MATHEMATICS & STATISTICS. LECTURE 45 Planning Production Levels: Linear Programming.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Introduction to Linear Programming BSAD 141 Dave Novak.
Linear Programming Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
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.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
LINEAR PROGRAMMING.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Introduction to Linear Programming and Formulation Meeting 2 Course: D Deterministic Optimization Year: 2009.
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
LINEAR PROGRAMMING MEANING:
Introduction to Quantitative Business Methods (Do I REALLY Have to Know This Stuff?)
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
Linear Programming Wyndor Glass Co. 3 plants 2 new products –Product 1: glass door with aluminum framing –Product 2: 4x6 foot wood frame window.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
Supply Chain Management By Dr. Asif Mahmood Chapter 9: Aggregate Planning.
Class 10: Introduction to Linear Programming
Operations Research Chapter one.
Linear Programming for Solving the DSS Problems
Linear Programming.
Constraint management
Linear Programming Introduction.
Linear Programming Problem
Module B Linear Programming.
Linear Programming Introduction.
Linear Programming.
Presentation transcript:

1 DSCI 3023 Linear Programming Developed by Dantzig in the late 1940’s A mathematical method of allocating scarce resources to achieve a single objective The objective may be profit, cost, return on investment, sales, market share, space, time LP is used for production planning, capital budgeting, manpower scheduling, gasoline blending By companies such as AMD, New York Life, Chevron, Ford

2 DSCI 3023 Linear Programming Decision Variables –symbols used to represent an item that can take on any value (e.g., x 1 =labor hours, x 2 =# of workers) Parameters –known constant values that are defined for each problem (e.g., price of a unit, production capacity) Decision Variables and Parameters will be defined for each unique problem

3 DSCI 3023 Linear Programming A method for solving linear mathematical models Linear Functions f(x) = 5x + 1 g(x 1, x 2 ) = x 1 + x 2 Non-linear functions f(x) = 5x g(x 1, x 2 ) = x 1 x 2 + x 2

4 DSCI 3023 Formulating an LP Define the decision variables –identifying the key variables whose values we wish to determine Determine the objective function –determine what we are trying to do –Maximize profit, Minimize total cost Formulate the constraints –determine the limitations of the decision variables

5 DSCI Parts of a Linear Program Objective Function Constraints Non-negativity assumptions

6 DSCI Parts of a Linear Program Objective Function –linear relationships of decision variables describing the problems objective –always consists of maximizing or minimizing some value –e.g., maximize Z = profit, minimize Z = cost

7 DSCI Parts of a Linear Program Constraints –linear relationships of decision variables representing restrictions or rules –e.g., limited resources like labor or capital Non-negativity assumptions –restricts decision variables to values greater than or equal to zero

8 DSCI 3023 Objective Function Always a Max or Min statement –Maximize Profit –Minimize Cost A linear function of decision variables –Maximize Profit = Z = 3x 1 + 5x 2 –Minimize Cost = Z = 6x x 2

9 DSCI 3023 Constraints Constraints are restrictions on the problem –total labor hours must be less than 50 –x 1 must use less than 20 gallons of additive Defined as linear relationships –total labor hours must be less than 50 x 1 + x 2 < 50 –x 1 must use less than 20 gallons of additive x 1 < 20

10 DSCI 3023 Non-negativity Assumptions Negative decision variables are inconceivable in most LP problems Minus 10 units of production or a negative consumption make no sense The assumptions are written as follows –x 1, x 2 > 0

11 DSCI 3023 LP Standard Form Each LP must contain the three parts A standard form for a LP is as follows: MaximizeZ = c 1 x 1 + c 2 x c n x n subject toa 11 x 1 + a 12 x a 1n x n < b 1. a m1 x 1 + a m2 x a mn x n < b m x 1, x 2, x n > 0

12 DSCI 3023 Methods of Solving LP Problems Two basic solution approaches of linear programming exist The graphical Method –simple, but limited to two decision variables The simplex method –more complex, but solves multiple decision variable problems

13 DSCI 3023 Graphical Method 1. Construct an x-y coordinate plane/graph 2. Plot all constraints on the plane/graph 3. Identify the feasible region dictated by the constraints 4. Identify the optimum solution by plotting a series of objective functions over the feasible region 5. Determine the exact solution values of the decision variables and the objective function at the optimum solution