A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems

Abstract A global optimization algorithm for nonconvex Generalized Disjunctive Programming (GDP) problems is proposed in this paper. By making use of convex underestimating functions for bilinear, linear fractional and concave separable functions in the continuous variables, the convex hull of each nonlinear disjunction is constructed. The relaxed convex GDP problem is then solved in the first level of a two-level branch and bound algorithm, in which a discrete branch and bound search is performed on the disjunctions to predict lower bounds. In the second level, a spatial branch and bound method is used to solve nonconvex NLP problems for updating the upper bound. The proposed algorithm exploits the convex hull relaxation for the discrete search, and the fact that the spatial branch and bound is restricted to fixed discrete variables in order to predict tight lower bounds. Application of the proposed algorithm to several example problems is shown, as well as a comparison with other algorithms.

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

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

[3]  Paul I. Barton,et al.  Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems , 2000 .

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

[5]  Juan M. Zamora,et al.  Continuous global optimization of structured process systems models , 1998 .

[6]  Ignacio E. Grossmann,et al.  Mixed-Integer Nonlinear Programming: A Survey of Algorithms and Applications , 1997 .

[7]  Ignacio E. Grossmann,et al.  Simultaneous optimization models for heat integration—II. Heat exchanger network synthesis , 1990 .

[8]  Christodoulos A. Floudas,et al.  Global optimization of MINLP problems in Process Synthesis and Design , 1997 .

[9]  J. E. Falk,et al.  An Algorithm for Separable Nonconvex Programming Problems , 1969 .

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

[11]  Ignacio E. Grossmann,et al.  A modelling and decomposition strategy for the MINLP optimization of process flowsheets , 1989 .

[12]  Ignacio E. Grossmann,et al.  Simultaneous synthesis, sizing, and scheduling of multiproduct batch plants , 1990 .

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

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

[15]  N. Sahinidis,et al.  Global optimization of nonconvex NLPs and MINLPs with applications in process design , 1995 .

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

[17]  C. Floudas,et al.  Global Optimization in Generalized Geometric Programming , 1997, Encyclopedia of Optimization.

[18]  Zdravko Kravanja,et al.  Simultaneous optimization models for heat integration. , 1990 .

[19]  Paul I. Barton,et al.  Modeling of combined discrete/continuous processes , 1994 .

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

[21]  C. Adjiman,et al.  Global optimization of mixed‐integer nonlinear problems , 2000 .

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

[23]  Christodoulos A. Floudas,et al.  Rigorous convex underestimators for general twice-differentiable problems , 1996, J. Glob. Optim..

[24]  I. Grossmann,et al.  Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis , 1988 .

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

[26]  I. Grossmann,et al.  Modeling issues and implementation of language for disjunctive programming , 2000 .

[27]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[28]  Juan M. Zamora,et al.  A global MINLP optimization algorithm for the synthesis of heat exchanger networks with no stream splits , 1998 .

[29]  Ignacio E. Grossmann,et al.  Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation , 2003, Comput. Optim. Appl..