Lecture

Linear Programming: Solving LPs

Description

This lecture covers the process of solving Linear Programs (LPs) using the original 19th-century simplex method, including the algorithm's steps, iterations, and key takeaways on the closeness of variables. The instructor demonstrates how small changes in variables can lead to significant outcomes, proving this in two steps. The lecture emphasizes the importance of small increments in variables to achieve optimal results.

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
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.