Question

ILUUIPO) Use the simplex method to solve the linear programming problem. Maximize z = 7x1 + 2X2 + X3 subject to: x4 +5x2 + 7x3 58 *4 + 4x2 + 11x3 59 with X, 20, X20, X, 20 O A. Maximum is 9 when xy = 1, X2 = 1, X3 = 0 OB. Maximum is 63 when xy = 9, X2 = 0, X3 = 0 O C. Maximum is 56 when xy = 8, X2 = 0, X3 = 0 OD. Maximum is 0 when xy = 0, x2 = 0, X3 = 8 Click to select your answer.

Answer 1

0 S2 0 O O c Var S1 S2 z C-Z 7 X1 1 1 0 7 2 X2 5 4 0 2 1 X3 7 11 0 1 0 S1 1 0 0 0 1 8 9 2 = 0 0 Iteration: c 2 1 0 1 Var X1 X2 X3 S1 S2 0911 5 7 10 8 8 0 S2 1 4 11 0 1 9 9 z 0 0 0 0 0 2 = 0 cz 7 2 1 0 0 || key column 3 key row 3 key element 1.0

Iteration: 7 O c 7 Var X1 X1 1 S20 z 7 C- Z O 2 X2 5 -1 35 -33 1 X3 7 4 49 -48 0 S1 1 -1 7 -7 0 S2 0 1 0 0 8 1 Z = 0 0 56 Solution: X1 = 8.0 Z = 56.0
therefore option C is correct

Z=56,

X1=8 ,X2=0,X3=0 .