Challenger App

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:

Simplex problem is considered as infeasible when
The simplex method is used for solving ________________________problems.
Linear programming can be applied effectively only if:
As per one of the assumptions of linear programming problem in operation research, objective function and constraints are assumed to be _____________
For which of the following situations, linear programming can be applied?