If in the optimal solution of a linear programming problem, a non-basic variable has zero value in the Cj – Zj row, the problem
A. Has no feasible solution
B. Has multiple optimal solutions
C. is unbounded
D. (A) and (B), but not (C)
Answer:B
If in the optimal solution of a linear programming problem, a non-basic variable has zero value in the Cj – Zj row, the problem
A. Has no feasible solution B. Has multiple optimal solutions C. is unbounded D. (A) and (B), but not (C)