Saba Bahouth 1 Supplement 6 Linear Programming. Saba Bahouth 2  Scheduling school busses to minimize total distance traveled when carrying students 

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Chapter 19 – Linear Programming
Introduction to Mathematical Programming
Planning with Linear Programming
Linear Programming Problem
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Session II – Introduction to Linear Programming
Chapter 2: Modeling with Linear Programming & sensitivity analysis
8/27: Linear Programming Lecture: LP Small Groups Homework.
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.
Linear Programming Introduction George B Dantzig developed LP in It is a problem solving approach designed to help managers/decision makers in planning.
B Linear Programming PowerPoint presentation to accompany
© 2006 Prentice Hall, Inc.B – 1 Operations Management Module B – Linear Programming © 2006 Prentice Hall, Inc. PowerPoint presentation to accompany Heizer/Render.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Optimization Methods LI Xiao-lei ftp:// :112/upload.
Operations Management
B-1 Operations Management Linear Programming Module B.
1 2TN – Linear Programming  Linear Programming. 2 Linear Programming Discussion  Requirements of a Linear Programming Problem  Formulate:  Determine:Graphical.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
B-1 Operations Management Linear Programming Module B.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
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
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
3.4 Linear Programming.
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.
Operations Management
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.
___________________________________________________________________________ Operations Research  Jan Fábry Linear Programming.
B Linear Programming PowerPoint presentation to accompany
___________________________________________________________________________ Quantitative Methods of Management  Jan Fábry Linear Programming.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
1/17: DSCB Getting Started, Linear Programming Administrative Issues –Syllabus –Calendar –Get usernames, addresses, majors Linear Programming.
 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.
McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies, Inc. All rights reserved. 6S Linear Programming.
Constraint management Constraint Something that limits the performance of a process or system in achieving its goals. Categories: Market (demand side)
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
LINEAR PROGRAMMING.
© 2008 Prentice Hall, Inc.B – 1 Operations Management Module B – Linear Programming PowerPoint presentation to accompany Heizer/Render Principles of Operations.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
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 3.4 Learning goals represent constraints by equations or inequalities, and by systems of equations and/or inequalities, and interpret.
1 What you will learn  Lots of vocabulary!  How to find the maximum and minimum value of a function given a set of “rules”
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
Linear Programming. George Dantzig 1947 NarendraKarmarkar Pioneers of LP.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
1. What does a need to be if there were infinitely many solutions to the system of equations. y + 2x = 12 2y + 4x = 2a.
Introduction Operations Research (OR) It is a scientific approach to determine the optimum (best) solution to a decision problem under the restriction.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J B-1 PENYELESAIAN.
Supply Chain Management By Dr. Asif Mahmood Chapter 9: Aggregate Planning.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming.
Linear Programming Models: Graphical and Computer Methods
MID-TERM EXAM/REVISION
Introduction to Linear Programs
Operations Management Linear Programming Module B
Linear Programming Objectives: Set up a Linear Programming Problem
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Constraint management
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Module B Linear Programming.
Linear Programming.
Presentation transcript:

Saba Bahouth 1 Supplement 6 Linear Programming

Saba Bahouth 2  Scheduling school busses to minimize total distance traveled when carrying students  Allocating police patrol units to high crime areas in order to minimize response time to 911 calls  Scheduling tellers at banks so that needs are met during each hour of the day while minimizing the total cost of labor  Picking blends of raw materials in feed mills to produce finished feed combinations at minimum costs  Selecting the product mix in a factory to make best use of machine and labor-hours available while maximizing the firm’s profit  Allocating space for a tenant mix in a new shopping mall so as to maximize revenues to the leasing company Examples of Successful LP Applications

Saba Bahouth 3 Simple Example and Solution We make 2 products: Panels and Doors Panel: Labor: 2 hrs/unit Material:3 #/unit Door: Labor: 4 hrs/unit Material:1 #/unit Available Resources: Labor:80 hrs Material:60 # Profit: $10 per Panel $ 8 per Door

Saba Bahouth 4 Enumeration for Simple Example

Saba Bahouth 5 Material - wood Labor - hrs X2 - Doors X1 - Panels Add Paint Constraint (Resource)

Saba Bahouth 6 Let # of Colonial lots be Let # of Western lots be 1)Wood: 2)Pressing Time: 3)Finishing Time: 4)Budget: Max. profit Example Solution Using Simplex

Saba Bahouth Optimal Solution: X 1 = X 2 = Profit = $ 12,945.20

Saba Bahouth 8

9 Requirements of a Linear Programming Problem  Must seek to maximize or minimize some quantity (the objective function)  Objectives and constraints must be expressible as linear equations or inequalities  Presence of restrictions or constraints - limits ability to achieve objective  Must be willing to accept divisibility  Must have a convex feasible space

Saba Bahouth 10

Saba Bahouth 11 You’re an analyst for a division of Kodak, which makes BW & color chemicals. At least 30 tons of BW and at least 20 tons of color must be made each month. The total chemicals made must be at least 60 tons. How many tons of each chemical should be made to minimize costs? Color: $ 3,000 manufacturing cost per ton per month BW: $2,500 manufacturing cost per ton per month Minimization Example

Saba Bahouth 12 Graphical Solution Tons, Color Chemical (X 2 ) Tons, BW Chemical (X 1 ) BW Color Total X1X1 X2X2 Find values for X 1 + X 2  60 X 1  30 X 2  20