Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By perfect formulation, we mean a system of linear inequalities that describes the convex hull of feasible solutions, viewed as vectors. Natural perfect formulations often have a number of inequalities that is exponential in the size of the data needed to describe the problem. Here we are particularly interested in situations where the addition of a polynomial number of extra variables allows a formulation with a polynomial number of inequalities. Such formulations are called compact extended formulations. We survey various tools for deriving and studying extended formulations, such as Fouriers procedure for projection, Minkowski-Weyls theorem, Balas theorem for the union of polyhedra, Yannakakis theorem on the size of an extended formulation, dynamic programming, and variable discretization. For each tool that we introduce, we present one or several examples of how this tool is applied. In particular, we present compact extended formulations for several graph problems involving cuts, trees, cycles and matchings, and for the mixing set, and we present the proof of Fiorini, Massar, Pokutta, Tiwary and de Wolf of an exponential lower bound for the cut polytope. We also present Bienstocks approximate compact extended formulation for the knapsack problem, Goemans result on the size of an extended formulation for the permutahedron, and the Faenza-Kaibel extended formulation for orbitopes.
extended formulations combinatorial optimization polyhedral combinatorics