The simplex method of linear programming (LP):
A) considers only the extreme points of the feasible region to achieve efficiency in solving LP problems
B) explicitly enumerates all corner points of the feasible region and selects the best objective function value
C) evaluates all constraints for feasibility
D) is not used in the Analytic Solver Platform software

Question

Quizplus · Accepted Answer

The simplex method considers only the extreme points (also known as basic feasible solutions) of the feasible region as potential solutions, which reduces the number of calculations required and improves efficiency in solving LP problems.

The Simplex Method of Linear Programming (LP)