Global optimization of mixed‐integer nonlinear problems

Two novel deterministic global optimization algorithms for nonconvex mixed-integer problems (MINLPs) are proposed, using the advances of the αBB algorithm for nonconvex NLPs of Adjiman et al. The special structure mixed-integer αBB algorithm (SMIN-αBB) addresses problems with nonconvexities in the continuous variables and linear and mixed-bilinear participation of the binary variables. The general structure mixed-integer αBB algorithm (GMIN-αBB) is applicable to a very general class of problems for which the continuous relaxation is twice continuously differentiable. Both algorithms are developed using the concepts of branch-and-bound, but they differ in their approach to each of the required steps. The SMIN-αBB algorithm is based on the convex underestimation of the continuous functions, while the GMIN-αBB algorithm is centered around the convex relaxation of the entire problem. Both algorithms rely on optimization or interval-based variable-bound updates to enhance efficiency. A series of medium-size engineering applications demonstrates the performance of the algorithms. Finally, a comparison of the two algorithms on the same problems highlights the value of algorithms that can handle binary or integer variables without reformulation.

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

[2]  A. H. Masso,et al.  Branch and Bound Synthesis of Integrated Process Designs , 1970 .

[3]  G. Ribiere,et al.  Experiments in mixed-integer linear programming , 1971, Math. Program..

[4]  G. Nemhauser,et al.  Integer Programming , 2020 .

[5]  A. M. Geoffrion.  Generalized Benders decomposition , 1972 .

[6]  George Stephanopoulos,et al.  Studies in process synthesis—I: Branch and bound strategy with list techniques for the synthesis of separation schemes , 1975 .

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

[8]  David A. H. Jacobs,et al.  The State of the Art in Numerical Analysis. , 1978 .

[9]  Omprakash K. Gupta,et al.  Branch and Bound Experiments in Convex Nonlinear Integer Programming , 1985 .

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

[11]  Ignacio E. Grossmann,et al.  An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1987, Math. Program..

[12]  John J.J. Chen.  Comments on improvements on a replacement for the logarithmic mean , 1987 .

[13]  X. Yuan,et al.  Une méthode d'optimisation non linéaire en variables mixtes pour la conception de procédés , 1988 .

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

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

[16]  C. Floudas,et al.  Global optimum search for nonconvex NLP and MINLP problems , 1989 .

[17]  G. M. Ostrovsky,et al.  Discrete optimization of chemical processes , 1990 .

[18]  A. Neumaier.  Interval methods for systems of equations , 1990 .

[19]  Pierre Hansen,et al.  An analytical approach to global optimization , 1991, Math. Program..

[20]  I. Grossmann,et al.  An LP/NLP based branch and bound algorithm for convex MINLP optimization problems , 1992 .

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

[22]  Garth P. McCormick,et al.  Calculation of bounds on variables satisfying nonlinear inequality constraints , 1993, J. Glob. Optim..

[23]  Oded Berman,et al.  Optimization Models for Reliability of Modular Software Systems , 1993, IEEE Trans. Software Eng..

[24]  Christodoulos A. Floudas,et al.  New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints , 1993, J. Glob. Optim..

[25]  Frank Pettersson,et al.  Optimization of pump configurations as a MINLP problem , 1994 .

[26]  Christodoulos A. Floudas,et al.  Algorithmic approaches to process synthesis : logic and global optimization , 1994 .

[27]  John E. Mitchell,et al.  An improved branch and bound algorithm for mixed integer nonlinear programs , 1994, Comput. Oper. Res..

[28]  Christodoulos A. Floudas,et al.  Finding all solutions of nonlinearly constrained systems of equations , 1995, J. Glob. Optim..

[29]  C. Floudas.  Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications , 1995 .

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

[31]  T. Westerlund,et al.  An extended cutting plane method for solving convex MINLP problems , 1995 .

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

[33]  Mahmoud M. El-Halwagi,et al.  Global Optimization of Nonconvex MINLP’s by Interval Analysis , 1996 .

[34]  Different formulations for solving trim loss problems in a paper-converting mill with ILP , 1996 .

[35]  Christodoulos A. Floudas,et al.  New Formulations and Branching Strategies for the GOP Algorithm , 1996 .

[36]  Constantinos C. Pantelides,et al.  Global Optimisation of General Process Models , 1996 .

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

[38]  Christodoulos A. Floudas,et al.  Computational Results for an Efficient Implementation of the GOP Algorithm and Its Variants , 1996 .

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

[40]  M. F. Cardoso,et al.  A simulated annealing approach to the solution of minlp problems , 1997 .

[41]  I. Duff,et al.  The state of the art in numerical analysis , 1997 .

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

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

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

[45]  Nikolaos V. Sahinidis,et al.  A Finite Algorithm for Global Minimization of Separable Concave Programs , 1998, J. Glob. Optim..

[46]  Iiro Harjunkoski,et al.  An extended cutting plane method for a class of non-convex MINLP problems , 1998 .

[47]  A. Neumaier,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advances , 1998 .

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

[49]  C. Adjiman,et al.  A global optimization method, αBB, for general twice-differentiable constrained NLPs—II. Implementation and computational results , 1998 .

[50]  Christodoulos A. Floudas,et al.  Mixed-Integer Nonlinear Optimization in Process Synthesis , 1998 .

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

[52]  T. Westerlund,et al.  Convexification of different classes of non-convex MINLP problems , 1999 .

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