handout2

handout2 - Math 171A: Linear Programming Lecture 2...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Math 171A: Linear Programming Lecture 2 Properties of Linear Constraints Philip E. Gill c 2011 http://ccom.ucsd.edu/~peg/math171a Wednesday, January 5th, 2010 Recap The lecture slides and homework are posted on the class web-page. http://ccom.ucsd.edu/~peg/math171a Access to course materials requires a class account and password . The account name is your last name in lower case, e.g., gill The password is your student ID, e.g., a12345678 UCSD Center for Computational Mathematics Slide 2/44, Wednesday, January 5th, 2010 Recap: a simple linear program maximize x , y 3 x + 4 y (objective function) subject to 3 x + 2 y 200 (cranberry juice constraint) x + 2 y 100 (apple juice constraint) x (minimum resource constraint) y (minimum resource constraint) UCSD Center for Computational Mathematics Slide 5/44, Wednesday, January 5th, 2010 Feasible production plans 10 20 30 40 50 60 70 80 90 100 110 120 10 20 30 40 50 60 70 80 90 100 110 120 y x (70 , 20) infeasible ( x, y ) feasible ( x, y ) How do we maximize the profit? The profit is given by p = 3 x + 4 y If ( x , y ) = (0 , 0) then no punch is mixed and 3 x + 4 y = 0 no profit! All production plans ( x , y ) such that 3 x + 4 y = 0 give no profit. UCSD Center for Computational Mathematics Slide 7/44, Wednesday, January 5th, 2010 No profit scenario 10 20 30 40 50 60 70 80 90 100 110 120 10 20 30 40 50 60 70 80 90 100 110 120 y x p = 0 We can find all production plans that give a profit of 120/ c by looking at all points on the line 3 x + 4 y = 120. e.g., (0 , 30) (only appleBerry produced) and (40 , 0) (only cranApple produced) give a profit of 120/ c. UCSD Center for Computational Mathematics Slide 9/44, Wednesday, January 5th, 2010 10 20 30 40 50 60 70 80 90 100 110 120 10 20 30 40 50 60 70 80 90 100 110 120 y x p = 120 The lines 3 x + 4 y = p are parallel as the profit p varies. If a profit line 3 x + 4 y = p has points in the feasible region, then those points define a feasible production plan with profit p . As the profit p is increased, the profit line moves to the upper right....
View Full Document

Page1 / 11

handout2 - Math 171A: Linear Programming Lecture 2...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online