1.

After introducing slack variables s and t, the initial basic feasible solution is represented by the table below (basic variables are s = 6 and t = 6, and the objective function value is 0). - 4- 6000s32106t23016 xystRHSAfter some simplex iterations, the following table is obtained. 000212s5/301-1/32y2/3101/32 xystRHSFrom this, one can conclude that

A. The LP has a unique optimal solution
B. The LP has an optimal solution that is not unique
C. The LP is infeasible
D. The LP is unbounded
Answer» C. The LP is infeasible


Discussion

No Comment Found