App Logo

No.1 PSC Learning App

1M+ Downloads
In the Simplex method if in pivot column all the entries are negative or zero when choosing leaving variable then

ASolution is Degenerate

BSolution is infeasible

CAlternative optima

DUnbounded

Answer:

D. Unbounded

Read Explanation:

The Simplex method improves the initial feasible solution until the optimum solution is reached. If all replacement ratios are negative, the solution is unbounded. If artificial variables are present in the base, the solution is infeasible. If some values in the constant column are zero, the solution is degenerate. Multiple optimal solutions exist if a non-basic variable in the final simplex table has a net zero contribution. In the given scenario, if all entries in the pivot column are negative or zero, the solution is unbounded.


Related Questions:

Identify the odd one out with respect to queuing theory.
Simplex problem is considered as infeasible when
Which of the following is NOT correct critical path method (CPM) used in Project scheduling?
Identify the odd one out with respect to PERT.
One of the assumptions in the game theory is: