Fundamental theorem of linear programming: Difference between revisions

Revision as of 07:09, 5 April 2013

Revision as of 02:03, 1 August 2015

Line 1:

In [[appliedmathematical mathematics]]optimization, the '''fundamental theorem of [[linear programming]]''' states, in a weak formulation, states that the [[maxima and minima]] of a [[linear function]] over a [[convex polygon]]al 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.

==Statement==

Line 29:

{{mathapplied-stub}}

{{comp-sci-stub}}

[[Category:Linear programming]]