The conventional statement of linear programming duality is completely inscrutable. Prime: maximise subject to and . Dual: minimise subject to and . If either problem has a finite optimum then so does the other, and the optima agree. I do understand concrete examples. Suppose we want to pack the maximum number vertex-disjoint copies of a graph …