Back to Notes
Farkas and Gordan Theorems
Farkas' Theorem
Given and , exactly one of the following holds:
- there is with , ,
- there is with , .
Proof Consider the LP and its dual,
- 1 true implies 2 false LP is feasible with objective value 0, so by weak duality every dual feasible has .
- 2 false implies 1 true is dual feasible with value 0, and since 2 is false no feasible does better, so DP has optimal value 0. By strong duality LP has an optimal solution, in particular it is feasible.
Gordan's Theorem
Given , exactly one of the following holds:
- there is with , , ,
- there is with .
Proof 2 holds iff there are , with , i.e. iff there is with
This is the second alternative of Farkas for the matrix and right-hand side , so it holds iff there is no with
i.e. no with whose coordinates sum to 1. The system is homogeneous, so any , with can be scaled by to sum to 1. So this is the same as no , with , i.e. 1 is false.