An extended cutting plane method for a class of non-convex MINLP problems

An extended cutting plane method is introduced. The extended method can be applied in the solution of a class of non-convex MINLP (mixed-integer non-linear programming) problems, although the method was originally introduced for the solution of convex problems only. Global convergence properties of the method are given for pseudo-convex MINLP problems in the present paper and a numerical example from the paper-converting industry is finally provided to illustrate the numerical procedure.

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

[2]  Sven Leyffer,et al.  Numerical Experience with Lower Bounds for MIQP Branch-And-Bound , 1998, SIAM J. Optim..

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

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Serge Domenech,et al.  Experiments in process synthesis via mixed-integer programming , 1989 .

[6]  Sven Leyffer,et al.  Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..

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

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

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

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

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

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

[13]  R. J. Dakin,et al.  A tree-search algorithm for mixed integer programming problems , 1965, Comput. J..

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

[15]  I. Grossmann.  Global Optimization in Engineering Design , 2010 .

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

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

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

[19]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .