Linear Programming 27: Optimality is no harder than feasibility

Linear Programming 27: Optimality is no harder than feasibility

Abstract: We give a third explanation for why finding an optimal solutions is no harder than finding a feasible solution, using the 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