Weak duality theorem (linear programme)

maths

Statement

Lemma

Let $x$ be a feasible point for a linear programme given by $A$, $b$, and $c$. Let $y$ be a feasible point for the dual linear programme then we have the following inequality

$$c^Tx = \sum_j c_j x_j \leq \sum_i b_i y_i = y^Tb.$$

Proof

Recall that the dual linear programme was specified by $-A^T$, $-c$ and $-b$. So we have

$$-A^Ty \leq -c, \mbox{ therefore } A^Ty \geq c$$

and so we have

$$c^Tx \leq (A^Ty)^Tx = y^TAx \leq y^Tb.$$