Lecture 13: Duality in Linear Programming
MIT OpenCourseWare · 76:12
This lecture finishes linear-programming duality: after recapping weak duality and the three feasibility/boundedness cases, it shows how to form the dual of a non-canonical LP, proves complementary slackness, gives a...