Linear Programming 32: Proof of strong duality from the Farkas lemma

Linear Programming 32: Proof of strong duality from the Farkas lemma

Abstract: We describe the strong duality of linear programing, using the Farkas lemma.

This video accompanies the class "Linear Programming and Network Flows" at Colorado State University
https://www.math.colostate.edu/~adams...

We are following the book "Understanding and Using Linear Programming" by Jirí Matoušek and Bernd Gärtner
https://link.springer.com/book/10.100...

Our course notes are available at
https://www.math.colostate.edu/~adams...