Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

solve this linear programming problem using the simplex method. Maximize P 20x 5

ID: 3204757 • Letter: S

Question

solve this linear programming problem using the simplex method. Maximize P 20x 50y subject to these constraints 8x 70y s 280 4x 20 y s 86 8x 30y s 140 16x 30y s 196 20x 20y 230 x 20, y 2 0 Maximum value for P This value of Poccurs when x- and y If ul, 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: ul u2 u3 u4 u5

Explanation / Answer

1)

P= 280

x= 7 y = 2.8

u1 = 0

u2 = 2

u3= 28

u4 = 34

u5 = 0

x y Max
7 2.8 280
20 50
8 70 252 280
4 20 84 86
8 30 140 140
16 30 196 196
20 20 196 230