A Polyhedral Study of Binary Polynomial Programs

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.

[1]  Nikolaos V. Sahinidis,et al.  Analysis of Bounds for Multilinear Functions , 2001, J. Glob. Optim..

[2]  C. Helmberg,et al.  Solving quadratic (0,1)-problems by semidefinite programs and cutting planes , 1998 .

[3]  Manfred W. Padberg,et al.  Boolean polynomials and set functions , 1993 .

[4]  Hanif D. Sherali,et al.  CONVEX ENVELOPES OF MULTILINEAR FUNCTIONS OVER A UNIT HYPERCUBE AND OVER SPECIAL DISCRETE SETS , 1997 .

[5]  Yves Crama.  Concave extensions for nonlinear 0–1 maximization problems , 1993, Math. Program..

[6]  Endre Boros,et al.  On quadratization of pseudo-Boolean functions , 2012, ISAIM.

[7]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[8]  Endre Boros,et al.  Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions , 1993, Math. Oper. Res..

[9]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

[10]  Endre Boros,et al.  Pseudo-Boolean optimization , 2002, Discret. Appl. Math..

[11]  S. Vajda,et al.  BOOLEAN METHODS IN OPERATIONS RESEARCH AND RELATED AREAS , 1969 .

[12]  Silvio Ursic,et al.  A Linear Characterization of NP-Complete Problems , 1984, CADE.

[13]  James E. Falk,et al.  Jointly Constrained Biconvex Programming , 1983, Math. Oper. Res..

[14]  Christodoulos A. Floudas,et al.  Convex envelopes for edge-concave functions , 2005, Math. Program..

[15]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[16]  Endre Boros,et al.  The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds , 1991, Ann. Oper. Res..

[17]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[18]  Michael Jünger,et al.  Experiments in quadratic 0–1 programming , 1989, Math. Program..

[19]  Jean-Philippe P. Richard,et al.  KRANNERT GRADUATE SCHOOL OF MANAGEMENT , 2010 .

[20]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[21]  Fred W. Glover,et al.  Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program , 1974, Oper. Res..

[22]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems , 1990, SIAM J. Discret. Math..

[23]  Francisco Barahona,et al.  A solvable case of quadratic 0-1 programming , 1986, Discret. Appl. Math..

[24]  Yasutoshi Yajima,et al.  A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints , 1998, J. Glob. Optim..

[25]  Nikolaos V. Sahinidis,et al.  Global optimization of nonconvex problems with multilinear intermediates , 2015, Math. Program. Comput..

[26]  Manfred W. Padberg,et al.  The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[27]  Claude Berge,et al.  Hypergraphs - combinatorics of finite sets , 1989, North-Holland mathematical library.

[28]  Caterina De Simone,et al.  The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..

[29]  Pierre Hansen,et al.  Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..

[30]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[31]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[32]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[33]  G. Rinaldi,et al.  A cutting plane algorithm for the max-cut problem. , 1992 .

[34]  Mohit Tawarmalani,et al.  Inclusion Certificates and Simultaneous Convexification of Functions , 2010 .

[35]  Giovanni Rinaldi,et al.  Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case , 2007, SIAM J. Optim..

[36]  Sonia Cafieri,et al.  On convex relaxations of quadrilinear terms , 2010, J. Glob. Optim..

[37]  Ali Ridha Mahjoub,et al.  On the cut polytope , 1986, Math. Program..

[38]  James R. Luedtke,et al.  Some results on the strength of relaxations of multilinear functions , 2012, Math. Program..

[39]  F. Barahona.  The max-cut problem on graphs not contractible to K5 , 1983 .

[40]  Anatoliy D. Rikun,et al.  A Convex Envelope Formula for Multilinear Functions , 1997, J. Glob. Optim..

[41]  Adam N. Letchford,et al.  A new separation algorithm for the Boolean quadric and cut polytopes , 2014, Discret. Optim..