The Simplex Method of Linear Programming (LP)

question 73

Multiple Choice

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