LINEAR PROGRAMMING (LP)

Slides:



Advertisements
Similar presentations
© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
Advertisements

1Introduction to Linear ProgrammingLesson 2 Introduction to Linear Programming.
LINEAR PROGRAMMING (LP)
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Session II – Introduction to Linear Programming
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
LINEAR PROGRAMMING (LP)
Managerial Decision Modeling with Spreadsheets
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
19 Linear Programming CHAPTER
B Linear Programming PowerPoint presentation to accompany
Operations Management
Introduction to Management Science
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
6s-1Linear Programming CHAPTER 6s Linear Programming.
Linear Programming OPIM 310-Lecture 2 Instructor: Jose Cruz.
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
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Linear Programming Models: Graphical and Computer Methods
9/1 More Linear Programming Collect homework Roll call Review homework Lecture - More LP Small Groups Lecture - Start using MS Excel Assign Homework.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
Linear Programming Chapter 14 Supplement. Lecture Outline Model Formulation Graphical Solution Method Linear Programming Model Solution Solving Linear.
3.4 Linear Programming.
Linear Programming Chapter 13 Supplement.
Operations Management
1 Linear Programming: Model Formulation and Graphical Solution.
1 Additional examples LP Let : X 1, X 2, X 3, ………, X n = decision variables Z = Objective function or linear function Requirement: Maximization of the.
CDAE Class 11 Oct. 3 Last class: Result of Quiz 2 2. Review of economic and business concepts Today: Result of Quiz 2 3. Linear programming and applications.
Management Science – MNG221 Linear Programming: Graphical Solution.
 A concert promoter wants to book a rock group for a stadium concert. A ticket for admission to the stadium playing field will cost $125, and a ticket.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
CDAE Class 12 Oct. 5 Last class: Quiz 3 3. Linear programming and applications Today: Result of Quiz 3 3. Linear programming and applications Next.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
10/2 The simplex algorithm. In an augmented matrix, if a column has a 1 and all other entries 0, it is said to be ‘in solution’. The 1 is called a ‘pivot’
1 Linear Programming (LP) 線性規劃 - George Dantzig, 1947.
CDAE Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
3.4: Linear Programming Objectives: Students will be able to… Use linear inequalities to optimize the value of some quantity To solve linear programming.
Example 3.2 Graphical Solution Method | 3.1a | a3.3 Background Information n The Monet Company produces two type of picture frames, which.
OSCM 230 Fall 2013 Management Science Lecture 4 Linear Programming II 9/11/2013, 9/16/ Lecture 4 Linear Programming II Professor Dong Washington.
LINEAR PROGRAMMING.
© 2008 Prentice Hall, Inc.B – 1 Operations Management Module B – Linear Programming PowerPoint presentation to accompany Heizer/Render Principles of Operations.
Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)
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
To Accompany Russell and Taylor, Operations Management, 4th Edition,  2003 Prentice-Hall, Inc. All rights reserved. Supplement S9 Linear Programming.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2)
University of Colorado at Boulder Yicheng Wang, Phone: , Optimization Techniques for Civil and Environmental Engineering.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Ardavan Asef-Vaziri Systems and Operations Management
Linear Programming Objectives: Set up a Linear Programming Problem
Factor as many polynomials as you can.
Chapter 8 Goal Programming.
Linear Programming Example: Maximize x + y x and y are called
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Module B Linear Programming.
Linear Programming: Model Formulation and Graphic Solution
Case 2:( Model Construction):
Linear Programming.
Presentation transcript:

LINEAR PROGRAMMING (LP) Lecture 09 Dr. Arshad Zaheer

Minimization Illustration

Solving Minimization Problems Formulated and solved in much the same way as maximization problems In the graphical approach an iso-cost line is used The objective is to move the iso-cost line inwards until it reaches the lowest cost corner point It might be useful at this point to discuss typical equipment utilization rates for different process strategies if you have not done so before.

Minimization Example X1 = number of tons of black-and-white picture chemical produced X2 = number of tons of color picture chemical produced Minimize total cost = 2,500X1 + 3,000X2 Subject to: X1 ≥ 30 tons of black-and-white chemical X2 ≥ 20 tons of color chemical X1 + X2 ≥ 60 tons total X1, X2 ≥ $0 nonnegativity requirements It might be useful at this point to discuss typical equipment utilization rates for different process strategies if you have not done so before.

Minimization Example X2 X1 + X2 = 60 Feasible region b a X1 = 30 60 – 50 – 40 – 30 – 20 – 10 – – | | | | | | | 0 10 20 30 40 50 60 X1 X2 Table B.9 X1 + X2 = 60 Feasible region b It might be useful at this point to discuss typical equipment utilization rates for different process strategies if you have not done so before. a X2 = 20 X1 = 30

Minimization Example Lowest total cost is at point a Total cost at a = 2,500X1 + 3,000X2 = 2,500 (40) + 3,000(20) = $160,000 Total cost at b = 2,500X1 + 3,000X2 = 2,500 (30) + 3,000(30) = $165,000 It might be useful at this point to discuss typical equipment utilization rates for different process strategies if you have not done so before. Lowest total cost is at point a

The Queen City Nursery manufactures bags of potting soil from compost and topsoil. Each cubic foot of compost costs 12 cents and contains 4 pounds of sand, 3 pounds of clay, and 5 pounds of humus. Each cubic foot of topsoil costs 20 cents and contains 3 pounds of sand, 6 pounds of clay, and 12 pounds of humus. Each bag of potting soil must contain at least 12 pounds of sand, at least 12 pounds of clay, and at least 10 pounds of humus. Plot the constraints and identify the feasible region. Graphically or with corner points find the best combination of compost and topsoil that meets the stated conditions at the lowest cost per bag. Identify the lowest cost possible.

Rienzi Farms grows sugar cane and soybeans on its 500 acres of land Rienzi Farms grows sugar cane and soybeans on its 500 acres of land. An acre of soybeans brings a $1000 contribution to overhead and profit; an acre of sugar cane has a contribution of $2000. Because of a government program no more than 200 acres may be planted in soybeans. During the planting season 1200 hours of planting time will be available. Each acre of soybeans requires 2 hours, while each acre of sugar cane requires 5 hours. The company seeks maximum contribution (profit) from its planting decision. a. Algebraically state the decision variables, objective and constraints. b. Plot the constraints c. Solve graphically, using the corner point method.