The optimal solution for a linear programming problem will always occur at an extreme point.

Question

Quizplus · Accepted Answer

This is a fundamental property of linear programming. The extreme points (also called vertices) of the feasible region are the only points where the constraints are "tight" or fully satisfied, and therefore they are the only points where the objective function value can be optimized. This is known as the "vertex method" or the "corner point method" of LP.

The Optimal Solution for a Linear Programming Problem Will Always