Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting

by   Alfonso Cevallos, et al.

Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very little known about what can be expressed by small mixed-integer programs. In particular, prior to this work, it was open whether some classical problems, like the minimum odd-cut problem, can be expressed by a compact mixed-integer program with few (even constantly many) integer variables. This is in stark contrast to linear formulations, where recent breakthroughs in the field of extended formulations have shown that many polytopes associated to classical combinatorial optimization problems do not even admit approximate extended formulations of sub-exponential size. We provide a general framework for lifting inapproximability results of extended formulations to the setting of mixed-integer extended formulations, and obtain almost tight lower bounds on the number of integer variables needed to describe a variety of classical combinatorial optimization problems. Among the implications we obtain, we show that any mixed-integer extended formulation of sub-exponential size for the matching polytope, cut polytope, traveling salesman polytope or dominant of the odd-cut polytope, needs Ω(n/ n) many integer variables, where n is the number of vertices of the underlying graph. Conversely, the above-mentioned polyhedra admit polynomial-size mixed-integer formulations with only O(n) or O(n n) (for the traveling salesman polytope) many integer variables. Our results build upon a new decomposition technique that, for any convex set C , allows for approximating any mixed-integer description of C by the intersection of C with the union of a small number of affine subspaces.


page 1

page 2

page 3

page 4


Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack

Standard mixed-integer programming formulations for the stable set probl...

MIP Formulations for the Steiner Forest Problem

The Steiner Forest problem is among the fundamental network design probl...

Binary extended formulations and sequential convexification

A binarization of a bounded variable x is a linear formulation with vari...

Compact Mathematical Programs For DEC-MDPs With Structured Agent Interactions

To deal with the prohibitive complexity of calculating policies in Decen...

On the convex hull of convex quadratic optimization problems with indicators

We consider the convex quadratic optimization problem with indicator var...

On the Split Closure of the Periodic Timetabling Polytope

The Periodic Event Scheduling Problem (PESP) is the central mathematical...

Generating Target Graph Couplings for QAOA from Native Quantum Hardware Couplings

We present methods for constructing any target coupling graph using limi...

Please sign up or login with your details

Forgot password? Click here to reset