# Strong duality theorem (linear programme)

Last edited: 2026-01-28

# Statement

Lemma

A linear programme is feasible and bounded if and only if the dual linear programme is feasible and bounded.

# Proof

This follows as the dual of the dual linear programme is the original linear programme and unbounded linear programmes have infeasible duals .

Note that a linear programme is feasible and bounded if it is feasible and the dual linear programme is feasible. However, this means the dual linear programme is feasible and its dual (the original linear programme) is feasible; therefore the dual linear programme is feasible and bounded.

Similarly, if the dual linear programme is feasible and bounded, then it is feasible and its dual (the original linear programme) is feasible. However, this means that the original linear programme and its dual are feasible, making the original linear programme feasible and bounded.