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

preview_player
Показать описание
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

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

Our course notes are available at
Рекомендации по теме
Комментарии
Автор

Thanks for the great video, I was only wondering; how do we know z >= 0 ?

heleenessink