Note on the Complexity of the Mixed-Integer Hull of a Polyhedron

TL;DR

This paper investigates the computational complexity of the mixed-integer hull of a polyhedron, providing algorithms for fixed dimensions and analyzing the number of vertices and facets involved.

Contribution

It introduces polynomial-time algorithms for computing the mixed-integer hull in fixed dimensions and bounds on the number of vertices, advancing understanding of its complexity.

Findings

Mixed-integer hull can have exponentially many vertices and facets in certain cases.

Polynomial-time algorithms exist for fixed n and d.

Bounds on the number of vertices of the mixed-integer hull are established.

Abstract

We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have exponentially many vertices and facets in $d$. For $n,d$ fixed, we give an algorithm to find the mixed integer hull in polynomial time. Given $P=\operatorname{conv}(V)$ and $n$ fixed, we compute a vertex description of the mixed-integer hull in polynomial time and give bounds on the number of vertices of the mixed integer hull.