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 definition of basic solutions in linear constraints, the conditions for a feasible basic solution, and the equivalence between vertices and feasible basic solutions. The instructor explains the necessary and sufficient conditions for a point to be a vertex of a polyhedron.