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.
Basic Solutions and Polyhedra
This lecture covers the concepts of extreme points, vertices, and basic feasible solutions in polyhedra. It explains the definitions and properties of these key elements, illustrating them with examples. The instructor also discusses the construction of basic solutions and the geometric intuition behind them, emphasizing the importance of linear independence. The lecture further explores degeneracy in basic solutions and the existence of basic feasible solutions in bounded polyhedra. It concludes with the optimality of basic feasible solutions and outlines a conceptual algorithm for finding optimal solutions.