Relaxations of mixed integer sets from lattice-free polyhedra

This paper gives an introduction to a recently established link between the geometry of numbers and mixed integer optimization. The main focus is to provide a review of families of lattice‐free polyhedra and their use in a disjunctive programming approach. The use of lattice‐free polyhedra in the context of deriving and explaining cutting planes for mixed integer programs is not only mathematically interesting, but it leads to some fundamental new discoveries, such as an understanding under which conditions cutting planes algorithms converge finitely.