18 June 2016 in Mathematical Programming
1 May 2017 in Mathematics of Operations Research
We study the polyhedral convex hull of a mixed-integer set 𝒮 defined by a collection of multilinear equations over the unit hypercube. Such sets appear frequently in the factorable reformulation of mixed-integer nonlinear optimization problems. In particular, the set 𝒮 represents the feasible region of a linearized unconstrained binary polynomial optimization problem. We define an equivalent hypergraph representation of the mixed-integer set 𝒮, which enables us to derive several families of facet-defining inequalities, structural properties, and lifting operations for its convex hull in the space of the original variables. Our theoretical developments extend several well-known results from the Boolean quadric polytope and the cut polytope literature, paving a way for devising novel optimization algorithms for nonconvex problems containing multilinear sub-expressions.
9 March 2006 in International Transactions in Operational Research
1 January 2018 in SIAM Journal on Optimization
We consider the multilinear polytope defined as the convex hull of the set of binary points $z$ satisfying a collection of equations of the form $z_e = \prod_{v \in e} {z_v}$, $e \in E$, where $E$ denotes a family of subsets of $\{1, \ldots , n\}$ of cardinality at least two. Such sets are of fundamental importance in many types of mixed-integer nonlinear optimization problems, such as $0-1$ polynomial optimization. Utilizing an equivalent hypergraph representation, we study the facial structure of the multilinear polytope in conjunction with the acyclicity degree of the underlying hypergraph. We provide explicit characterizations of the multilinear polytopes corresponding to Berge-acylic and $\gamma$-acyclic hypergraphs. As the multilinear polytope for $\gamma$-acyclic hypergraphs may contain exponentially many facets in general, we present a strongly polynomial-time algorithm to solve the separation problem, implying polynomial solvability of the corresponding class of $0-1$ polynomial optimization prob...
6 August 2019 in Mathematical Programming Computation
1 August 2021 in Mathematics of Operations Research
The multilinear polytope of a hypergraph is the convex hull of a set of binary points satisfying a collection of multilinear equations. We introduce the running intersection inequalities, a new class of facet-defining inequalities for the multilinear polytope. Accordingly, we define a new polyhedral relaxation of the multilinear polytope, referred to as the running intersection relaxation, and identify conditions under which this relaxation is tight. Namely, we show that for kite-free beta-acyclic hypergraphs, a class that lies between gamma-acyclic and beta-acyclic hypergraphs, the running intersection relaxation coincides with the multilinear polytope and it admits a polynomial size extended formulation.