LP Ch.5: Linear Programming with the Simplex Method - Gurobi Optimization

9. Show without using the Simplex Method that x1 = (5)/(26), x2 = (5)/(2), x3 = (27)/(26) is an optimal solution to the following linear programming problem: Maximize z = 9x1 + 14x2 + 7x3 subject to 2x1 + x2 + 3x3 ≤ 6 5x1 + 4x2 + x3 ≤ 12 2x2 ≤ 5 x1, x2, x3 unrestricted. (Hint: Formulate the dual of this problem and then find a feasible solution.)

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