Global optimization of bilinear programs with a multiparametric disaggregation technique

In this paper, we present the derivation of the multiparametric disaggregation technique (MDT) by Teles et al. (J. Glob. Optim., 2011) for solving nonconvex bilinear programs. Both upper and lower bounding formulations corresponding to mixed-integer linear programs are derived using disjunctive programming and exact linearizations, and incorporated into two global optimization algorithms that are used to solve bilinear programming problems. The relaxation derived using the MDT is shown to scale much more favorably than the relaxation that relies on piecewise McCormick envelopes, yielding smaller mixed-integer problems and faster solution times for similar optimality gaps. The proposed relaxation also compares well with general global optimization solvers on large problems.

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

[2]  Y. Nesterov.  Semidefinite relaxation and nonconvex quadratic optimization , 1998 .

[3]  George L. Nemhauser,et al.  Modeling disjunctive constraints with a logarithmic number of binary variables and constraints , 2008, Math. Program..

[4]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[5]  I. Grossmann.  Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .

[6]  I. Karimi,et al.  Piecewise MILP under‐ and overestimators for global optimization of bilinear programs , 2008 .

[7]  Pedro M. Castro,et al.  Global optimization of water networks design using multiparametric disaggregation , 2012, Comput. Chem. Eng..

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

[9]  Pedro M. Castro,et al.  Multi-parametric disaggregation technique for global optimization of polynomial programming problems , 2013, J. Glob. Optim..

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

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

[12]  Ignacio E. Grossmann,et al.  A Novel Global Optimization Approach to the Multiperiod Blending Problem , 2012 .

[13]  Jacek Jez.  Review of Water Network Design Methods with Literature Annotations , 2012 .

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

[15]  Christodoulos A. Floudas,et al.  Global Optimization of Large-Scale Generalized Pooling Problems: Quadratically Constrained MINLP Models , 2010 .

[16]  Muhittin Oral,et al.  A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems , 1992, Oper. Res..

[17]  Christodoulos A. Floudas,et al.  GloMIQO: Global mixed-integer quadratic optimizer , 2012, Journal of Global Optimization.

[18]  Christodoulos A. Floudas,et al.  APOGEE: Global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes , 2011, Comput. Chem. Eng..

[19]  Chrysanthos E. Gounaris,et al.  Computational Comparison of Piecewise−Linear Relaxations for Pooling Problems , 2009 .

[20]  Yinyu Ye,et al.  Approximating quadratic programming with bound and quadratic constraints , 1999, Math. Program..

[21]  X. M. Martens,et al.  Comparison of generalized geometric programming algorithms , 1978 .

[22]  Peiping Shen,et al.  Global optimization of signomial geometric programming using linear relaxation , 2004, Appl. Math. Comput..

[23]  Ignacio E. Grossmann,et al.  A global optimization algorithm for linear fractional and bilinear programs , 1995, J. Glob. Optim..

[24]  Sonia Cafieri,et al.  Reformulations in Mathematical Programming: A Computational Approach , 2009, Foundations of Computational Intelligence.

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

[26]  Ignacio E. Grossmann,et al.  Global superstructure optimization for the design of integrated process water networks , 2011 .

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

[28]  C. Floudas,et al.  Quadratic Optimization , 1995 .

[29]  David Kendrick,et al.  GAMS, a user's guide , 1988, SGNM.

[30]  Miguel J. Bagajewicz,et al.  A review of recent design procedures for water networks in refineries and process plants , 2000 .

[31]  Juan P. Ruiz,et al.  Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization , 2012 .

[32]  Arne Stolbjerg Drud,et al.  CONOPT - A Large-Scale GRG Code , 1994, INFORMS J. Comput..

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

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

[35]  X. M. Martens,et al.  Comparison of Generalized Geometric Programming Algorithms , 1978 .

[36]  Ignacio E. Grossmann,et al.  Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks , 2011, Optim. Lett..

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

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

[39]  Willi Hock,et al.  Lecture Notes in Economics and Mathematical Systems , 1981 .

[40]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[41]  George L. Nemhauser,et al.  Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions , 2010, Oper. Res..

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

[43]  Hong-Kun Xu.  An Iterative Approach to Quadratic Optimization , 2003 .

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

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

[46]  N. Sahinidis,et al.  Convexification and Global Optimization in Continuous And , 2002 .

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

[48]  Edward M. B. Smith,et al.  Global optimisation of nonconvex MINLPs , 1997 .

[49]  Christodoulos A. Floudas,et al.  ADVANCES FOR THE POOLING PROBLEM: MODELING, GLOBAL OPTIMIZATION, AND COMPUTATIONAL STUDIES , 2009 .

[50]  N. Shor.  Dual quadratic estimates in polynomial and Boolean programming , 1991 .