Skip to main content

All Questions

Filter by
Sorted by
Tagged with
19 votes
4 answers
1k views

Applications of linear programming duality in combinatorics

So, I know that one can apply the strong LP duality theorem to specific instances of maximum flow problems to recover some nontrivial theorems in combinatorics, such as Hall's theorem, Koenig's ...