Linear Programming 31: A variant of the Farkas lemma

Linear Programming 31: A variant of the Farkas lemma

Abstract: We describe a variant of the Farkas lemma, which is for systems of linear inequalities instead of systems of linear equalities. We will later use this variant to prove the strong duality of linear programming.

This video accompanies the class "Linear Programming and Network Flows" at Colorado State University

We are following the book "Understanding and Using Linear Programming" by Jirí Matoušek and Bernd Gärtner

Our course notes are available at