In mathematical optimization, the fundamental theorem of linear programming states, in a weak formulation, 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.
Consider the optimization problem
min
c
T
x
subject to
x
∈
P
Where
P
=
{
x
∈
R
n
:
A
x
≤
b
}
. If
P
is a bounded polyhedron (and thus a polytope) and
x
∗
is an optimal solution to the problem, then
x
∗
is either an extreme point (vertex) of
P
, or lies on a face
F
⊂
P
of optimal solutions.
Suppose, for the sake of contradiction, that
x
∗
∈
i
n
t
(
P
)
. Then there exists some
ϵ
>
0
such that the ball of radius
ϵ
centered at
x
∗
is contained in
P
, that is
B
ϵ
(
x
∗
)
⊂
P
. Therefore,
x
∗
−
ϵ
2
c
|
|
c
|
|
∈
P
and
c
T
(
x
∗
−
ϵ
2
c
|
|
c
|
|
)
=
c
T
x
∗
−
ϵ
2
c
T
c
|
|
c
|
|
=
c
T
x
∗
−
ϵ
2
|
|
c
|
|
<
c
T
x
∗
.
Hence
x
∗
is not an optimal solution, a contradiction. Therefore,
x
∗
must live on the boundary of
P
. If
x
∗
is not a vertex itself, it must be the convex combination of vertices of
P
, say
x
1
,
.
.
.
,
x
t
. Then
x
∗
=
∑
i
=
1
t
λ
i
x
i
with
λ
i
≥
0
and
∑
i
=
1
t
λ
i
=
1
. Observe that
0
=
c
T
(
(
∑
i
=
1
t
λ
i
x
i
)
−
x
∗
)
=
c
T
(
∑
i
=
1
t
λ
i
(
x
i
−
x
∗
)
)
=
∑
i
=
1
t
λ
i
(
c
T
x
i
−
c
T
x
∗
)
.
Since
x
∗
is an optimal solution, all terms in the sum are nonnegative. Since the sum is equal to zero, we must have that each individual term is equal to zero. Hence,
c
T
x
∗
=
c
T
x
i
for each
x
i
, so every
x
i
is also optimal, and therefore all points on the face whose vertices are
x
1
,
.
.
.
,
x
t
, are optimal solutions.
