Use the simplex method to solve the linear programming problem. Maximize Z = 3x1 2X2 subject to: 2X1 3x2 < 4x1 2X2 < 12 with X1 2 0,X2 2 00A Maximum is 4 when X1 = 0,X2 = 2 0 B. Maximum is 6 when X1 = 2,X2 = 0 0 C Maximum is 9 when X1 = 3,X2 = 0 0 D. Maximum is 12 when X, = 2,X2 = 3

1 solve the following linear optimization problem using the two phase simplex method minimize x1 2x2 2x3 subject to 2x1 x2 x3 1 x1 x2 x3 3 x1 2 0 x2 2 0 x3 0 27156

Answered: Solve the linear programming problem using the simplex method. Maximize P= 9x, + 2x, - X3 X, + X2 - Xg s3 2x, + 4x2 + 3x3 s 9 Xq, X2, X3 2 0 subject to Use the… | bartleby