Reformulation-Linearization Methods for Global Optimization

Discrete and continuous nonconvex programming problems arise in a host of practical applications in the context of production planning and control, location-allocation, distribution, economics and game theory, quantum chemistry, and process and engineering design situations. Several recent advances have been made in the development of branch-and-cut type algorithms for mixed-integer linear and nonlinear programming problems, as well as polyhedral outer-approximation methods for continuous nonconvex programming problems. At the heart of these approaches is a sequence of linear (or convex) programming relaxations that drive the solution process, and the success of such algorithms is strongly tied in with the strength or tightness of these relaxations.

[1]  Hanif D. Sherali,et al.  Tighter Representations for Set Partitioning Problems , 1996, Discret. Appl. Math..

[2]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems , 2005, Ann. Oper. Res..

[3]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[4]  Hanif D. Sherali,et al.  Effective Relaxations and Partitioning Schemes for Solving Water Distribution Network Design Problems to Global Optimality , 2001, J. Glob. Optim..

[5]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[6]  Hanif D. Sherali,et al.  A Reformulation-Linearization Technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions , 2009, Discret. Appl. Math..

[7]  Hanif D. Sherali,et al.  New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems , 1997, Oper. Res. Lett..

[8]  Hanif D. Sherali,et al.  Tight Relaxations for Nonconvex Optimization Problems Using the Reformulation-Linearization/Convexification Technique (RLT) , 2002 .

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

[10]  Hanif D. Sherali,et al.  Mixed-integer bilinear programming problems , 1993, Math. Program..

[11]  Hanif D. Sherali,et al.  A Global Optimization Approach to a Water Distribution Network Design Problem , 1997, J. Glob. Optim..

[12]  Hanif D. Sherali,et al.  A Pseudo-Global Optimization Approach with Application to the Design of Containerships , 2003, J. Glob. Optim..

[13]  Hanif D. Sherali,et al.  A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem , 2005, J. Glob. Optim..

[14]  Hanif D. Sherali,et al.  On Solving Polynomial, Factorable, and Black-Box Optimization Problems Using the RLT Methodology , 2005 .

[15]  Hanif D. Sherali,et al.  A Quadratic Partial Assignment and Packing Model and Algorithm for the Airline Gate Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[16]  Hanif D. Sherali,et al.  Sequential and Simultaneous Liftings of Minimal Cover Inequalities for Generalized Upper Bound Constrained Knapsack Polytopes , 1995, SIAM J. Discret. Math..

[17]  H. Sherali,et al.  Enumeration Approach for Linear Complementarity Problems Based on a Reformulation-Linearization Technique , 1998 .

[18]  Hanif D. Sherali,et al.  A reformulation-convexification approach for solving nonconvex quadratic programming problems , 1995, J. Glob. Optim..

[19]  Warren P. Adams,et al.  A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems , 1986 .

[20]  Hanif D. Sherali,et al.  Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems , 1998, Oper. Res..

[21]  Hanif D. Sherali,et al.  A Decomposition Algorithm for a Discrete Location-Allocation Problem , 1984, Oper. Res..

[22]  Hanif D. Sherali,et al.  On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems , 2002, Oper. Res..

[23]  Hanif D. Sherali,et al.  Global optimization of nonconvex factorable programming problems , 2001, Math. Program..

[24]  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..

[25]  Hanif D. Sherali,et al.  A Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem , 2005, J. Glob. Optim..

[26]  Hanif D. Sherali,et al.  A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints , 2006, Discret. Optim..

[27]  Hanif D. Sherali,et al.  A squared-euclidean distance location-allocation problem , 1992 .

[28]  Hanif D. Sherali,et al.  Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents , 1998, J. Glob. Optim..

[29]  Hanif D. Sherali,et al.  Enhancing RLT relaxations via a new class of semidefinite cuts , 2002, J. Glob. Optim..

[30]  Hanif D. Sherali,et al.  A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique , 1992, J. Glob. Optim..

[31]  Hanif D. Sherali,et al.  A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope , 1995, Oper. Res. Lett..

[32]  Leo Liberti,et al.  Reduction constraints for the global optimization of NLPs , 2004 .

[33]  Hanif D. Sherali,et al.  A Localization and Reformulation Discrete Programming Approach for the Rectilinear Distance Location-Allocation Problem , 1994, Discret. Appl. Math..

[34]  Hanif D. Sherali,et al.  Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems , 2002, Oper. Res..

[35]  Leo Liberti.  Linearity Embedded in Nonconvex Programs , 2005, J. Glob. Optim..

[36]  Hanif D. Sherali,et al.  Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems , 1990, Oper. Res..

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

[38]  Y. Crama,et al.  Upper-bounds for quadratic 0-1 maximization , 1990 .

[39]  Leo Liberti,et al.  An Exact Reformulation Algorithm for Large Nonconvex NLPs Involving Bilinear Terms , 2006, J. Glob. Optim..

[40]  Hanif D. Sherali,et al.  A new reformulation-linearization technique for bilinear programming problems , 1992, J. Glob. Optim..