Solving Linear Programming Problems Graphically

Slides:



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

Linear Programming Problem
LINEAR PROGRAMMING (LP)
Linear Programming Problem
LINEAR PROGRAMMING (LP)
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
8/27: Linear Programming Lecture: LP Small Groups Homework.
Objective 3-4 Linear Programming Solve linear programming problems.
Dr. Ayham Jaaron First semester 2013/2014 August 2013
Chapter 2 Linear Programming Models: Graphical and Computer Methods © 2007 Pearson Education.
Introduction to Management Science
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 Models: Graphical Methods 5/4/1435 (1-3 pm)noha hussein elkhidir.
Chapter 3 An Introduction to Linear Programming
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
Determine if the given ordered pair is a solution of
3.4 Linear Programming.
Module B: Linear Programming
2-1 Linear Programming: Model Formulation and Graphical Solution Chapter 2 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall.
THE GALAXY INDUSTRY PRODUCTION PROBLEM -
Objective Vocabulary Solve linear programming problems.
LP: Summary thus far Requirements Graphical solutions Excel Sensitivity Analysis.
A LINEAR PROGRAMMING PROBLEM HAS LINEAR OBJECTIVE FUNCTION AND LINEAR CONSTRAINT AND VARIABLES THAT ARE RESTRICTED TO NON-NEGATIVE VALUES. 1. -X 1 +2X.
11C. Linear Programming. What is a linear programming problem? 1.A set of variables (in Further Maths there will only ever be two variables) called decision.
Linear Programming Advanced Math Topics Mrs. Mongold.
1Barnett/Ziegler/Byleen Finite Mathematics 12e Learning Objectives for Section 5.2  The student will be able to solve systems of linear inequalities graphically.
Holt McDougal Algebra Linear Programming Linear programming is method of finding a maximum or minimum value of a function that satisfies a given.
Linear Programming Short-run decision making model –Optimizing technique –Purely mathematical Product prices and input prices fixed Multi-product production.
Section 3-4 Objective: To solve certain applied problems using linear programming. Linear Programming.
2-1 Modeling with Linear Programming Chapter Optimal Solution for New Objective Function Graphical Solution of Maximization Model (12 of 12) Maximize.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
Linear Programming Healthy Animals. Algebra Standards   MM3A6. Students will solve linear programming problems in two variables.   a. Solve systems.
Don Sutton Spring LP Basic Properties Objective Function – maximize/minimize profit/cost Resource Constraints – labor, money Decision.
EMGT 5412 Operations Management Science Linear Programming: Introduction, Formulation and Graphical Solution Dincer Konur Engineering Management and Systems.
MIT and James Orlin © The Geometry of Linear Programs –the geometry of LPs illustrated on GTC.
1 1 Slide Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an.
7.6 Systems of Linear Inequalities Word Problems Use a system of linear inequalities to model a real-life situation.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
An Introduction to Linear Programming
An Introduction to Linear Programming Pertemuan 4
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Chapter 2 An Introduction to Linear Programming
Digital Lesson Linear Programming.
Do Now The cost of renting a pool at an aquatic center is either $30 an hr. or $20 an hr. with a $40 non refundable deposit. Use algebra to find for how.
Managerial Economics Linear Programming
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
3.4 Review of Linear Programming
EMGT 5414 Introduction to OR
Linear Programming A potter wants to make and sell serving bowls and plates. A bowl uses 5 pounds of clay. A plate uses 4 pounds of clay. The potter has.
Algebra: Graphs, Functions, and Linear Systems
Do Now! Solve the system of equations Do all work on the notecard.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Objective Vocabulary Solve linear programming problems.
3-4 Linear Programming Warm Up Lesson Presentation Lesson Quiz
Factor as many polynomials as you can.
Max Z = x1 + x2 2 x1 + 3 x2  6 (1) x2  1.5 (2) x1 - x2  2 (3)
Linear Programming Example: Maximize x + y x and y are called
Copyright © 2014, 2010, 2007 Pearson Education, Inc.
Linear Programming Problem
Module B Linear Programming.
Graphical solution A Graphical Solution Procedure (LPs with 2 decision variables can be solved/viewed this way.) 1. Plot each constraint as an equation.
1.6 Linear Programming Pg. 30.
BUS-221 Quantitative Methods
Introduction to Linear Programming
Linear Programming: Model Formulation and Graphic Solution
Presentation transcript:

Solving Linear Programming Problems Graphically Finite 3-2

Example 1: Surviving in an island Linear programming will save you! Suppose that you will be left in a deserted island You want to live as many days as you can to increase chance of rescue Fortunately (!), you can take a bag with you to the island What would you put into the bag? Example 1: Surviving in an island

Example 1: Surviving in an island The bag can carry at most 50 lbs There are limited set of items you can carry Bread: You can survive for 2 days with 1 lb of bread Steak: You can survive for 5 days with 1 lb of steak (Memphis style grilled!) Chicken: You can survive for 3 days with 1 lb of chicken (southern style deep fried!) Chocolate: You can survive for 6 days with 1 lb of chocolate How much of each item to take with you? Example 1: Surviving in an island

Example 1: Formulation Steps STEP 0: Know the problem and gather your data Your problem is to increase your chance of rescue by maximizing the number of days you survive You can have 1 bag which can carry 50 lbs at most You can only put bread, steak, chicken and chocolate into you bag Each item enables you survive for a specific number of days for each pound you take Bread: 2 days/lb Steak: 5 days/lb Chicken: 3days/lb Chocolate: 6days/lb Example 1: Formulation Steps

Example 1: Formulation Steps STEP 1: Identify your decision variables Decision variables are the things you control The amount of each item you will take with you 𝑥 1 :𝑡ℎ𝑒 𝑎𝑚𝑜𝑢𝑛𝑡 𝑜𝑓 𝑏𝑟𝑒𝑎𝑑 (𝑙𝑏𝑠) 𝑥 2 :𝑡ℎ𝑒 𝑎𝑚𝑜𝑢𝑛𝑡 𝑜𝑓 𝑠𝑡𝑒𝑎𝑘 (𝑙𝑏𝑠) 𝑥 3 :𝑡ℎ𝑒 𝑎𝑚𝑜𝑢𝑛𝑡 𝑜𝑓 𝑐ℎ𝑖𝑐𝑘𝑒𝑛 (𝑙𝑏𝑠) 𝑥 4 :𝑡ℎ𝑒 𝑎𝑚𝑜𝑢𝑛𝑡 𝑜𝑓 𝑐ℎ𝑜𝑐𝑜𝑙𝑎𝑡𝑒 𝑙𝑏𝑠 Warning: Always be careful with the metrics (try to use the same metrics) Example 1: Formulation Steps

Example 1: Formulation Steps STEP 2: Define your objective function and objective Your objective function is the measure of performance as a result of your decisions Your objective is what you want to do with your objective function Recall that you want to maximize the number of days you will survive in the island Objective Performance measure Not a function though Example 1: Formulation Steps

Example 1: Formulation Steps STEP 2: We know our objective (maximize) and our performance of measure (number of days) Express the performance of measure as a function of your decision variables to get the objective function If you take 𝑥 1 lbs of bread, you will survive for 2𝑥 1 days If you take 𝑥 2 lbs of steak, you will survive for 5𝑥 2 days If you take 𝑥 3 lbs of chicken, you will survive for 3𝑥 3 days If you take 𝑥 4 lbs of chocolate, you will survive for 6𝑥 4 days Then objective function in terms of decision variables: 2𝑥 1 + 5𝑥 2 + 3𝑥 3 + 6𝑥 4 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 Example 1: Formulation Steps

Example 1: Formulation Steps STEP 3: Define your restrictions (constraints) There may be some restrictions which limit what you can do (hence, they define set of your alternatives) You can carry 1 bag and it can carry 50 lbs at most 𝑥 1 + 𝑥 2 + 𝑥 3 + 𝑥 4 ≤50 You cannot get negative amounts!!! 𝑥 1 ≥0, 𝑥 2 ≥0, 𝑥 3 ≥0, 𝑥 4 ≥0 Limit on how much you can carry Total amount you decide to carry Example 1: Formulation Steps

Example 1: LP Formulation Combine your objective, objective function, and constraints 2𝑥 1 + 5𝑥 2 + 3𝑥 3 + 6𝑥 4 𝑥 1 + 𝑥 2 + 𝑥 3 + 𝑥 4 ≤50 𝑥 1 ≥0, 𝑥 2 ≥0, 𝑥 3 ≥0, 𝑥 4 ≥0 This is your LP model Note that everything is linear! 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 Example 1: LP Formulation

Example 1: Extending the LP Suppose that you can also take cheese Cheese: You can survive for 4 days with 1 lb of cheese 𝑥 5 :𝑡ℎ𝑒 𝑎𝑚𝑜𝑢𝑛𝑓 𝑜𝑓 𝑐ℎ𝑒𝑒𝑠𝑒 𝑙𝑏𝑠 We have a new decision variable: Update LP 2𝑥 1 + 5𝑥 2 + 3𝑥 3 + 6𝑥 4 + 4𝑥 5 𝑥 1 + 𝑥 2 + 𝑥 3 + 𝑥 4 + 𝑥 5 ≤50 𝑥 1 ≥0, 𝑥 2 ≥0, 𝑥 3 ≥0, 𝑥 4 ≥0, 𝑥 5 ≥0 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 Example 1: Extending the LP

Example 1: Extending the LP Furthermore, suppose you have a budgetary limit 1 lb of bread costs you $3 1 lb of steak costs you $6 1 lb of chicken costs you $7 1 lb of chocolate costs you $15 1 lb of cheese costs you $8 You can spend at most $150 Write the new restriction: 3 𝑥 1 + 6𝑥 2 +7 𝑥 3 +15 𝑥 4 +8 𝑥 5 ≤150 Limit on how much you can spend Total money you decide to spend Example 1: Extending the LP

Example 1: Extending the LP 2𝑥 1 + 5𝑥 2 + 3𝑥 3 + 6𝑥 4 + 4𝑥 5 𝑥 1 + 𝑥 2 + 𝑥 3 + 𝑥 4 + 𝑥 5 ≤50 3 𝑥 1 + 6𝑥 2 +7 𝑥 3 +15 𝑥 4 +8 𝑥 5 ≤150 𝑥 1 ≥0, 𝑥 2 ≥0, 𝑥 3 ≥0, 𝑥 4 ≥0, 𝑥 5 ≥0 You cannot get more meat (chicken+steak) than bread 𝑥 2 + 𝑥 3 ≤ 𝑥 1 For each lb of cheese, you need at least 2 lbs of bread 2𝑥 5 ≤ 𝑥 1 𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜 Example 1: Extending the LP

Summary of Formulation Steps Gather all of your data, know what they mean Then Identify your decision variables Identify your objective and objective function Identify your constraints Express your objective function and constraints in terms of your decision variables Steps 2 and 3 can change order Summary of Formulation Steps

Summary of the Graphical Method Write the objective function and all constraints Graph the feasible region Identify all corner points Find the value of the objective function at all corner points Summary of the Graphical Method

Practice

Practice

Practice

Practice

Practice

Practice

Pages 124 – 126 1, 5, 9, 13, 15 Use Graph Paper Homework