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 basics of linear programming, focusing on the simplex method. It explains how to find optimal solutions by iteratively moving along edges of a polyhedron. The instructor discusses the concept of bases, non-basic variables, and degenerate points. The lecture also addresses the process of removing variables from the basis to improve the cost. Additionally, it explores the importance of finding initial BFS and dealing with degeneracy in the context of linear programming problems.