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.
Lecture
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 discusses Doignon's theorem in integer programming, which states that a set is minimally infeasible if the removal of any constraint makes it feasible. The theorem, introduced by Doignon in 1973, is explained with mathematical notation and a proof. The lecture also covers the concept of convex hull and the conditions for a set to be considered infeasible.