The optimal solution to any linear programming model is a corner point of a polygon.

Name: The optimal solution to any linear programming model is a corner point of a polygon.
Brand: Quizplus
Rating: 4.9 (38 reviews)

Question

Quizplus · Accepted Answer

In linear programming, the feasible solution space for constraints is a convex polygon (or polyhedron in higher dimensions), and the optimal solution, if it exists, is always found at a corner point (vertex) of this polygon due to the linear nature of both the objective function and the constraints.

The Optimal Solution to Any Linear Programming Model Is a Corner