Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the fundamentals of linear programming, starting with optimization problems, cost functions, and the simplex algorithm. It then delves into the geometry of linear programs, discussing convex hulls, extreme points, and basic feasible solutions. The instructor explains the concept of degeneracy in linear programming and demonstrates how to solve LP problems using the simplex method, focusing on calculating reduced costs and identifying optimal solutions.