## The multilinear polytope of beta-acyclic hypergraphs has polynomial extension complexity

Article Download View The multilinear polytope of beta-acyclic hypergraphs has polynomial extension complexity

Article Download View The multilinear polytope of beta-acyclic hypergraphs has polynomial extension complexity

In this article, we provide an overview of some of our recent results on the facial structure of the multilinear polytope with a special focus on its decomposability properties. Namely, we demonstrate that, in the context of mixed-integer nonlinear optimization, the decomposability of the multilinear polytope plays a key role from both theoretical and algorithmic … Read more

We consider the Multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. Such sets are of fundamental importance in many types of mixed-integer nonlinear optimization problems, such as binary polynomial optimization. Utilizing an equivalent hypergraph representation, we study the facial structure of the Multilinear polytope … Read more