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

SOLVED: Problem 1. (20 marks) While solving a LP problem using the Simplex method, we arrive at the following tableau, with "3, "4, and T5 being the hasic variables:basicT1T2 T3 T4T5 solution  1013 14 1 -4 0T5The entries 4. 8 and 0 in the tableau are uknown parameters For one of the following statements, find some parameter values (there is n1O need to find all) that will make the statement trueThe current solution is optimal.The optimal value is 0The current solution is feasible hbut not optima

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