Question

Simplex problem is considered as infeasible when

• A. All the variables in entering column are negative
• B. Variables in the basis are negative
• C. Artificial variable is present in basis
• D. Pivotal value is negative

Answer 1

Answer:

C. Artificial variable is present in basis

The Simplex Method solves linear programming problems with inequalities. Infeasible solutions occur when artificial variables are present in the basis. Unbounded solutions happen when all entries in the pivot column are negative or zero. Degenerated solutions arise when some values in the constant column are zero, and multiple solutions occur when the non-basic variable has a net zero contribution.