Extended formulations for the multilinear polytope of acyclic hypergraphs

Abstract

This article provides an overview of our joint work on binary polynomial optimization over the past decade. We define the multilinear polytope as the convex hull of the feasible region of a linearized binary polynomial optimization problem. By representing the multilinear polytope with hypergraphs, we investigate the connections between hypergraph acyclicity and the complexity of the facial structure of the multilinear polytope. We characterize the acyclic hypergraphs for which a polynomial-size extended formulation for the multilinear polytope can be constructed in polynomial time.