Answer: Corner point method.
- A Vertex elimination method
- B Corner point method
- C Slope-intercept method
- D Substitution method
Correct answer: B. Corner point method
Explanation: The corner point method evaluates Z at each corner point of the feasible region to find the maximum or minimum value.
The feasible region (shaded) is bounded by the constraint lines; the fundamental theorem of LPP guarantees the optimal value of the objective function occurs at one of the corner points (O, A, B, C), so only these need to be checked, not the entire region.
Concept context
Optimizing a linear objective function subject to linear constraints using the graphical corner point method.