Fundamental theorem of linear programming: Difference between revisions

Revision as of 06:50, 5 April 2013

Latest revision as of 03:07, 20 April 2025

(14 intermediate revisions by 11 users not shown)

Line 1:

{{short description|Extremes of a linear function over a convex polygonal region occur at the region's corners}}
In [[appliedmathematical mathematicsoptimization]], 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 9 ⟶ 10:

==Proof==

Suppose, for the sake of contradiction, that <math>x^\ast \in \mathrm{int}(P)</math>,. thenThen there exists some <math>\epsilon > 0</math> such that the ball of radius <math>\epsilon</math> centered at <math>x^\ast</math> is contained in <math>P</math>, that is <math>B_{\epsilon}(x^\ast) \subset P</math>. Therefore,

:<math>x^\ast - \frac{\epsilon}{2} \frac{c}{||c||} \in P</math> and

:<math>c^T\left( x^\ast - \frac{\epsilon}{2} \frac{c}{||c||}\right) = c^T x^\ast - \frac{\epsilon}{2} \frac{c^T c}{||c||} = c^T x^\ast - \frac{\epsilon}{2} ||c|| < c^T x^\ast.</math>

Hence <math>x^\ast</math> is not an optimal solution, a contradiction. Therefore, <math>x^\ast</math> must live on the boundary of <math>P</math>. If <math>x^\ast</math> is not a vertex itself, it must be the convex combination of vertices of <math>P</math>, say <math>x_1, ..., x_t</math>. Then <math>x^\ast = \sum_{i=1}^t \lambda_i x_i</math> with <math>\lambda_i \geq 0</math> and <math>\sum_{i=1}^t \lambda_i = 1</math>. Observe that

And hence we have a contradiction because <math>x^\ast</math> is not an optimal solution.

:<math>0 = c^{T}\left(\left(\sum_{i=1}^{t }\lambda_i x_ilambda_{i}x_{i}\right)-x^{\ast}\right) = c^{T}\left(\sum_{i=1}^{t }\lambda_i lambda_{i}(x_i x_{i}- x^{\ast})\right) = \sum_{i=1}^{t }\lambda_i lambda_{i}(c^Tx_i {T}x_{i}- c^Tx{T}x^{\ast}).</math>

Therefore,Since <math>x^{\ast}</math> mustis livean onoptimal solution, all terms in the boundarysum ofare <math>P</math>nonnegative. Since Ifthe <math>x^\ast</math>sum is notequal ato vertex itselfzero, itwe must behave thethat convexeach combinationindividual ofterm verticesis equal ofto <math>P</math>zero. That is thatHence, <math>c^{T}x^{\ast }= \sum_c^{T}x_{i=1}^t</math> \lambda_ifor each <math>x_i</math>, withso every <math>\lambda_i > 0x_i</math> is also optimal, and therefore all points on the face whose vertices are <math>\sum_{i=1}^tx_1, \lambda_i =..., 1x_t</math>., are Thenoptimal we must havesolutions.

==References==

:<math>0 = c^T\left(\left(\sum_{i=1}^t \lambda_i x_i\right)-x^\ast\right) = c^T\left(\sum_{i=1}^t \lambda_i (x_i - x^\ast)\right) = \sum_{i=1}^t \lambda_i (c^Tx_i - c^Tx^\ast)</math>

* {{cite book |last=Bertsekas |first=Dimitri P. |title=Nonlinear Programming |year=1995 |edition=1st |publisher=Athena Scientific |___location=Belmont, Massachusetts |page=Proposition B.21(c) |isbn=1-886529-14-0}}

Since all terms in the sum are nonpositive and the sum is equal to zero, we must have that each individual term is equal to zero. Hence, every <math>x_i</math> is also optimal, and therefore all points on the face whose vertices are <math>x_1, ..., x_t</math>, are all optimal solutions.

* {{cite web |title=The Fundamental Theorem of Linear Programming |url=http://demonstrations.wolfram.com/TheFundamentalTheoremOfLinearProgramming/ |website=WOLFRAM Demonstrations Project |access-date=25 September 2024}}

==References==

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

{{Fundamental theorems}}

[[Category:Fundamental theorems]]

[[Category:Linear programming]]

{{mathapplied-stub}}

[[Category:Theorems in mathematical analysis]]

{{comp-sci-stub}}