Consider the linear programming problem

Maximize P=60x+50y.

x+y≤80

5x+10y≤560

50x+20y≤1600

x≥0

y≥0

3 answers

http://www.wolframalpha.com/widget/widgetPopup.jsp?p=v&id=1e692c6f72587b2cbd3e7be018fd8960&title=Linear%20Programming%20Calculator&theme=blue

==========================
3220 at (12,50)
==========================

maximize | function | 60 x + 50 y\ndomain | x + y<=80 && 5 x + 10 y<=560 && 50 x + 20 y<=1600 && x>=0 && y>=0
Global maximum:
max{60 x + 50 y|x + y<=80 && 5 x + 10 y<=560 && 50 x + 20 y<=1600 && x>=0 && y>=0} = 3220 at (x, y) = (12, 50)
therefore at the intersection of
5x+10y≤560
and
50x+20y≤1600
If you want to do it manually, on graph paper, plot these lines:

x+y=80
5x+10y=560
50x+20y=1600
x=0 ; y=0
The acceptable solution region will be on the border or in the enclosed area. But there is a nice theorem in Math that tells us the maximum will lie on the border, at one of the intersecting border lines. So test the corners with P=60x+50y, and you will find the maximum in a jiffy.
Similar Questions
  1. Consider the linear programming problem:Maximize P=60x+50y. x+y≤80 5x+10y≤560 50x+20y≤1600 x≥0 y≥0 Use the simplex
    1. answers icon 2 answers
  2. Solve the linear programming problem by the simplex method.Maximize P = 5x + 4y subject to 3x + 5y < 78 4x + y < 36 x > 0, y > 0
    1. answers icon 1 answer
  3. Solve the linear programming problem by the simplex method.Maximize P = 27x + 27y + 36z subject to x + y + 3z < 15 4x + 4y + 3z
    1. answers icon 1 answer
  4. Use the simplex meth to solve the linear programming problemMaximize z = 8x1 + 2x2 Subject to: 4x1 + 3x2 < 11 X1 + 4x2 < 7 With
    1. answers icon 3 answers
more similar questions