question archive Use the simplex method to solve the linear programming problem
Use the simplex method to solve the linear programming problem
Subject:MathPrice: Bought3
Use the simplex method to solve the linear programming problem. Maximize z=X1 + 2x2 +X3 +6x4 subject to X1 + 8X2+ X3 + X4 S 40 7Xq + X2+ 5X3 + X4S 160 X1 20, X2 20, X3 20, X4 20 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. O A. The maximum is when x, = X2 X3 XA S1 = and s2 = O B. There is no maximum.
