This lecture covers the basics of linear programming, focusing on optimization and duality concepts. It explains how to formulate and solve linear programming problems, introducing the primal and dual problems. The instructor discusses the simplex method and duality theory, illustrating their application through examples.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace