What is the linear programming approach where substituting the coordinates of each corner point into the objective function determines the corner point which is optimal?
A)redundant constraints
B)binding constraints
C)surplus
D)slack constraints
E)enumeration

Question

Quizplus · Accepted Answer

This is the enumeration approach, where all possible corner points are found and evaluated through substitution into the objective function. The other options listed (redundant, binding, surplus, and slack constraints) refer to specific types of constraints in linear programming and are not related to the optimization process.

What Is the Linear Programming Approach Where Substituting the Coordinates