Integer Programming: Doignon's Theorem

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.