A quick practical guide to polyhedral analysis in integer programming

Polyhedral analysis is one of the most interesting elements of integer programming and has been often overlooked. It plays an important role in finding exact solutions to an integer program. In this paper, we will discuss what polyhedral analysis is, and how some constraints for an integer programming model are “ideal” in the sense that if the model contains all of these “ideal” constraints, then the integer optimal solution can be obtained by simply solving a linear programming relaxation of the integer program. This paper serves as a quick guide for young researchers and PhD students