4. [OR] Consider the following tableau, as an iteration of simplex method for a maximization linear...

 

Transcribed Image Text:

4. [OR] Consider the following tableau, as an iteration of simplex method for a maximization linear programming problem. Z X4 X1 X6 Z 1 0 0 0 X1 0 0 1 0 X2 -1 4 -1 2 X3 3 -5 2 -3 X4 0 1 0 0 X5 2 -3 1 -1 X6 0 0 0 1 RHS 20 30 10 10 What are the basic and non-basic variables in this iteration? Is this tableau optimal? If not, perform one simplex iteration and find the next tableau. 4. [OR] Consider the following tableau, as an iteration of simplex method for a maximization linear programming problem. Z X4 X1 X6 Z 1 0 0 0 X1 0 0 1 0 X2 -1 4 -1 2 X3 3 -5 2 -3 X4 0 1 0 0 X5 2 -3 1 -1 X6 0 0 0 1 RHS 20 30 10 10 What are the basic and non-basic variables in this iteration? Is this tableau optimal? If not, perform one simplex iteration and find the next tableau.