The simplex method can be used to solve the following linear programming problem. Maximize P = 35x + 28y

subject to these constraints:

5x + 8y 430

10x + 28y 1400

20x + 12y 980

25x + 4y 1000

10x + 12y 700

x 0, y 0

Maximum value for P = . This value of P occurs when x = and y = If u1, u2, u3, u4, and u5 represent the slack variables in the five constraints (u1 the slack variable in the top constraint listed above, u2 for the second, etc.), then give the values for each of the four slack variables when the optimal solution is reached:

u1 = u2 = u3 = u4 =