LP&CO 2026 Lecture-26
Nishad-Kothari-IIT-Madras · 55:28
This lecture closes the duality section of linear programming by giving a geometric optimality test. A vertex is optimal for an objective vector c exactly when c lies in the cone generated by the gradients of the cons...