Piecewise MILP under‐ and overestimators for global optimization of bilinear programs

Many practical problems of interest in chemical engineering and other fields can be formulated as bilinear programs (BLPs). For such problems, a local nonlinear programming solver often provides a suboptimal solution or even fails to locate a feasible one. Numerous global optimization algorithms devised for bilinear programs rely on linear programming (LP) relaxation, which is often weak, and, thus, slows down the convergence rate of the global optimization algorithm. An interesting recent development is the idea of using an ab initio partitioning of the search domain to improve the relaxation quality, which results in a relaxation problem that is a mixed-integer linear program (MILP) rather than LP, called as piecewise MILP relaxation. However, much work is in order to fully exploit the potential of such approach. Several novel formulations are developed for piecewise MILP under- and overestimators for BLPs via three systematic approaches, and two segmentation schemes. As is demonstrated and evaluated the superiority of the novel models is shown, using a variety of examples. In addition, metrics are defined to measure the effectiveness of piecewise MILP relaxation within a two-level-relaxation framework, and several theoretical results are presented, as well as valuable insights into the properties of such relaxations, which may prove useful in developing global optimization algorithms. © 2008 American Institute of Chemical Engineers AIChE J, 2008

[1]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[2]  Garth P. McCormick,et al.  Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems , 1976, Math. Program..

[3]  C. A. Haverly.  Studies of the behavior of recursion for the pooling problem , 1978, SMAP.

[4]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[5]  T. Umeda,et al.  Optimal water allocation in a petroleum refinery , 1980 .

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

[7]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[9]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[10]  Egon Balas.  On the convex hull of the union of certain polyhedra , 1988 .

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

[12]  L. Foulds,et al.  A bilinear approach to the pooling problem , 1992 .

[13]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

[14]  R. Raman,et al.  Modelling and computational techniques for logic based integer programming , 1994 .

[15]  Aharon Ben-Tal,et al.  Global minimization by reducing the duality gap , 1994, Math. Program..

[16]  I. Grossmann,et al.  Global optimization of bilinear process networks with multicomponent flows , 1995 .

[17]  Christodoulos A. Floudas,et al.  αBB: A global optimization method for general constrained nonconvex problems , 1995, J. Glob. Optim..

[18]  Nikolaos V. Sahinidis,et al.  A branch-and-reduce approach to global optimization , 1996, J. Glob. Optim..

[19]  Nikolaos V. Sahinidis,et al.  BARON: A general purpose global optimization software package , 1996, J. Glob. Optim..

[20]  H. Tuy.  Convex analysis and global optimization , 1998 .

[21]  N. Sahinidis,et al.  A Lagrangian Approach to the Pooling Problem , 1999 .

[22]  Edward M. B. Smith,et al.  A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs , 1999 .

[23]  Ignacio E. Grossmann,et al.  A Branch and Contract Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms , 1999, J. Glob. Optim..

[24]  C. Floudas.  Handbook of Test Problems in Local and Global Optimization , 1999 .

[25]  Christodoulos A. Floudas,et al.  Deterministic global optimization - theory, methods and applications , 2010, Nonconvex optimization and its applications.

[26]  Manfred W. Padberg,et al.  Approximating Separable Nonlinear Functions Via Mixed Zero-One Programs , 1998, Oper. Res. Lett..

[27]  J. Hooker.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[28]  I. Karimi,et al.  Planning production on a single processor with sequence-dependent setups part 1: determination of campaigns , 2001 .

[29]  N. Sahinidis,et al.  Product Disaggregation in Global Optimization and Relaxations of Rational Programs , 2002 .

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

[31]  Aldo R. Vecchietti,et al.  Modeling of discrete/continuous optimization problems: characterization and formulation of disjunctions and their relaxations , 2003, Comput. Chem. Eng..

[32]  Kaj-Mikael Björk,et al.  Some convexifications in global optimization of problems containing signomial terms , 2003, Comput. Chem. Eng..

[33]  Rajagopalan Srinivasan,et al.  Novel Solution Approach for Optimizing Crude Oil Operations , 2004 .

[34]  George L. Nemhauser,et al.  Models for representing piecewise linear cost functions , 2004, Oper. Res. Lett..

[35]  A. Neumaier.  Complete search in continuous global optimization and constraint satisfaction , 2004, Acta Numerica.

[36]  A. Neumaier.  Acta Numerica 2004: Complete search in continuous global optimization and constraint satisfaction , 2004 .

[37]  Iftekhar A. Karimi,et al.  An improved formulation for scheduling an automated wet-etch station , 2004, Comput. Chem. Eng..

[38]  Ignacio E. Grossmann,et al.  Retrospective on optimization , 2004, Comput. Chem. Eng..

[39]  Rajagopalan Srinivasan,et al.  A new continuous-time formulation for scheduling crude oil operations , 2004 .

[40]  R. Baker Kearfott,et al.  Decomposition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems , 1991, Computing.

[41]  Ignacio E. Grossmann,et al.  Logic-based outer approximation for globally optimal synthesis of process networks , 2005, Comput. Chem. Eng..

[42]  Tamás Vinkó,et al.  A comparison of complete global optimization solvers , 2005, Math. Program..

[43]  Christodoulos A. Floudas,et al.  Global optimization in the 21st century: Advances and challenges , 2005, Comput. Chem. Eng..

[44]  Christodoulos A. Floudas,et al.  Convex Underestimation of Twice Continuously Differentiable Functions by Piecewise Quadratic Perturbation: Spline αBB Underestimators , 2005, J. Glob. Optim..

[45]  Ignacio E. Grossmann,et al.  Global optimization for the synthesis of integrated water systems in chemical processes , 2006, Comput. Chem. Eng..

[46]  Christodoulos A. Floudas,et al.  Global optimization of a combinatorially complex generalized pooling problem , 2006 .

[47]  Iftekhar A. Karimi,et al.  Scheduling multistage, multiproduct batch plants with nonidentical parallel units and unlimited intermediate storage , 2007 .