In linear programming, if the feasible region is bounded, then the maximum and minimum values are both located at the vertices of the feasible region.
In linear programming, if the feasible region is bounded, then the maximum and minimum values are both located at the vertices of the feasible region.
The feasible region is the set of all points that satisfy the constraints of the linear programming problem. The vertices of the feasible region are the extreme points of the region, where the maximum and minimum values can occur.
By evaluating the objective function at each vertex, we can determine the maximum and minimum values of the linear programming problem.