Question: . At an intermediate step of the simplex algorithm (for maximization LP), the tableau is: +3x5 2 -201 -4x1 21 2x1 + x2 +13 +4

.
At an intermediate step of the simplex algorithm (for maximization LP), the tableau is: +3x5 2 -201 -4x1 21 2x1 + x2 +13 +4 -25 -3x5 = 15 = 4 = 2 = 6 = (a) (10 points) Find the range for the value of 3 such that optimal solution is unbounded. (b) (8 points) Find the range for the value of 3 such that an optimal solution will be reached in one iteration (one pivot) of simplex method performed on this tableau. (c) (2 points) Write down the optimal solution and optimal value reached in part (b).
Step by Step Solution
3.41 Rating (170 Votes )
There are 3 Steps involved in it
a 10 points Find the range for the value of such that optimal solution is unb ounded ANS WER The ran... View full answer
Get step-by-step solutions from verified subject matter experts
