Fundamental theorem of linear programming

The fundamental theorem of linear programming, in a weak formulation, states that the maxima and minima of a linear function over a convex polygonal region occur at the region's corners. Further, if an extreme value occurs at two corners, then it must also occur everywhere on the line segment between them.

References

• http://demonstrations.wolfram.com/TheFundamentalTheoremOfLinearProgramming/