Solve this linear programming problem by graphing. (Suggestions:If you are graphing by hand, draw a reasonably good picture to start with. Use graph paper and a straight edge to get the picture accurate enough that there is no doubt as to which lines are intersecting at the corner points of the solution region.If you are graphing with a calculator or graphing tool, make sure that your viewing window allows you to see what is going on in any areas where corner points are clustered closely together.)

Maximize P = 10x + 40y subject to these constraints:

 5x + 30y  300 15x + 50y  540 15x + 20y  360 15x + 10y  330 x  0, y  0 

(a) One of the corner points is (0,0). Find all the other corner points and list them in descending order, starting with the corner point which is located highest in the solution region (in other words, the one with the greatest y value).

(a) One of the corner points is (0,0). Find all the other corner points and list them in descending order, starting with the corner point which is located highest in the solution region (in other words, the one with the greatest y value).

This value of P occurs when x =

and y =