Suppose we have obtained the following tableau for a maximization problem. X1 X2 X3 X4 X5...

 

Transcribed Image Text:

Suppose we have obtained the following tableau for a maximization problem. X1 X2 X3 X4 X5 X6 RHS 1 10 C1 4 C2 1 a1 -5 a2 -1 1 -1 2 az -3 -4 1 3 State conditions on a,, a2, a3, b, c1, and c2 that are required to make the following statements true. (That is, your conditions should specify all of the cases under which the following statements are true.) a. The current solution is optimal, and there are alternative optimal solutions. b. The current basic solution is not a basic feasible solution. c. The current basic solution is a degenerate basic feasible solution. d. The current basic solution is feasible, but the LP is unbounded. e. The current basic solution is feasible, but the objective can be improved by replacing x6 as a basic variable with x1. Suppose we have obtained the following tableau for a maximization problem. X1 X2 X3 X4 X5 X6 RHS 1 10 C1 4 C2 1 a1 -5 a2 -1 1 -1 2 az -3 -4 1 3 State conditions on a,, a2, a3, b, c1, and c2 that are required to make the following statements true. (That is, your conditions should specify all of the cases under which the following statements are true.) a. The current solution is optimal, and there are alternative optimal solutions. b. The current basic solution is not a basic feasible solution. c. The current basic solution is a degenerate basic feasible solution. d. The current basic solution is feasible, but the LP is unbounded. e. The current basic solution is feasible, but the objective can be improved by replacing x6 as a basic variable with x1.