The simplex method of linear programming (LP):
A) moves to better and better corner point solution of the feasible region until no further objective function improvement can be achieved
B) explicitly enumerates all corner points of the feasible region and selects the best objective function value
C) evaluates all constraints for feasibility
D) does not covert all constraints to equalities

Question

Quizplus · Accepted Answer

The simplex method starts from an initial corner point solution and moves to better and better corner point solutions until no further improvement can be made. It does not explicitly enumerate all corner points or evaluate all constraints for feasibility. The method also converts all constraints to equalities through the introduction of slack or surplus variables.

The Simplex Method of Linear Programming (LP)