Solve this linear programming problem using the simplex method. (Suggestion: Use the row operations tool in decimal mode. Your answers may not come out as round numbers, but enter all answers accurate to at least 2 decimal places.)

Maximize P = 6x + 8y subject to these constraints:

4x + 9y117

9x + 6y135

x0 , y0

The maximum value for P =.

And this maximum occurs when x =and y =.

If u and v are the names for the slack variables used in the two constraints (u in the first constaint and v in the 2nd constraint), then give the values for u and v corresponding to the optimal corner point which produces the maximum value of P.

u =

v =