Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs

In this paper we present a framework to generate tight convex relaxations for nonconvex generalized disjunctive programs. The proposed methodology builds on our recent work on bilinear and concave generalized disjunctive programs for which tight linear relaxations can be generated, and extends its application to nonlinear relaxations. This is particularly important for those cases in which the convex envelopes of the nonconvex functions arising in the formulations are nonlinear (e.g. linear fractional terms). This extension is now possible by using the latest developments in disjunctive convex programming. We test the performance of the method in three typical process systems engineering problems, namely, the optimization of process networks, reactor networks and heat exchanger networks.

[1]  Sanjay Mehrotra,et al.  A branch-and-cut method for 0-1 mixed convex programming , 1999, Math. Program..

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

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

[4]  I. Grossmann,et al.  New algorithms for nonlinear generalized disjunctive programming , 2000 .

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

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

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

[8]  Ignacio E. Grossmann,et al.  A hierarchy of relaxations for nonlinear convex generalized disjunctive programming , 2012, Eur. J. Oper. Res..

[9]  I. Grossmann,et al.  Relaxation strategy for the structural optimization of process flow sheets , 1987 .

[10]  Christodoulos A. Floudas,et al.  Convex underestimation for posynomial functions of positive variables , 2008, Optim. Lett..

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

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

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

[14]  Ignacio E. Grossmann,et al.  Global optimization algorithm for heat exchanger networks , 1993 .

[15]  Ignacio E. Grossmann,et al.  Strengthening of lower bounds in the global optimization of Bilinear and Concave Generalized Disjunctive Programs , 2010, Comput. Chem. Eng..

[16]  Ignacio E. Grossmann,et al.  Global optimization of nonlinear generalized disjunctive programming with bilinear equality constraints: applications to process networks , 2003, Comput. Chem. Eng..

[17]  I. Grossmann,et al.  A combined penalty function and outer-approximation method for MINLP optimization : applications to distillation column design , 1989 .

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

[19]  Christodoulos A. Floudas,et al.  Trigonometric Convex Underestimator for the Base Functions in Fourier Space , 2005 .

[20]  Hanif D. Sherali,et al.  Disjunctive Programming , 2009, Encyclopedia of Optimization.