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 cover all constraints to equalities

Question

Quizplus · Accepted Answer

The simplex method involves starting at any corner point of the feasible region and moving to better and better corner points until an optimal solution is found, meaning that no further improvement in the objective function can be achieved. It does not explicitly enumerate all corner points or evaluate all constraints for feasibility, and while it often results in equalities for some constraints, it does not cover all constraints to equalities. Thus, the best choice is A - moves to better and better corner point solution of the feasible region until no further objective function improvement can be achieved.

The Simplex Method of Linear Programming LP)