The Running Intersection Relaxation of the Multilinear Polytope 2: If a Hypergraph Is Not β-Acyclic, Its Multilinear Polytope Is Strictly Contained in the Running Intersection RelaxationResearch Paper
Many nonconvex optimization problems in binary variables have a polynomial objective or polynomial constraints. The standard way to bring them into the reach of linear and mixed-integer programming solvers is to introduce one new variable per monomial and to study the convex hull of the resulting set of feasible 0/1 vectors, the multilinear polytope. Strong…