Abstract
In this paper a new methodology is developed for the solution of mixed-integer nonlinear programs under uncertainty whose problem formulation is complicated by both noisy variables and black-box functions representing a lack of model equations. A branch-and-bound framework is employed to handle the integer complexity whereby the solution to the relaxed nonlinear program subproblem at each node is obtained using both global and local information. Global information is obtained using kriging models which are used to identify promising neighborhoods for local search. Response surface methodology (RSM) is then employed whereby local models are sequentially optimized to refine the problem’s lower and upper bounds. This work extends the capabilities of a previously developed kriging-response surface method enabling a wider class of problems to be addressed containing integer decisions and black box models. The proposed algorithm is applied to several small process synthesis examples and its effectiveness is evaluated in terms of the number of function calls required, number of times the global optimum is attained, and computational time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adjiman C.S., Androulakis I.P. and Floudas C.A. (1997). Global optimization of MINLP problems in process synthesis and design. Comp. Chem. Eng. 21: S445–S450
Adjiman C.S., Androulakis I.P. and Floudas C.A. (1998). A global optimization method, αBB, for general twice-differentiable constrained NLPs – II. Implementation and computational results. Comp. Chem. Eng. 22: 1159–1179
Adjiman C.S., Androulakis I.P. and Floudas C.A. (2000). Global optimization of mixed-integer nonlinear problems. AIChE J. 46: 1769–1797
Adjiman C.S., Androulakis I.P., Maranas C.D. and Floudas C.A. (1996). A global optimization method, alpha BB, for process design. Comp. Chem. Eng. 20: S419–S424
Barton R.R. and Ivey J.S. (1996). Nelder-mead simplex modifications for simulation optimization. Manag. Sci. 42: 954–973
Box G., Hunter S. and Hunter W.G. (2005). Statistics for Experimenters: Design, Innovation, and Discovery. Wiley-Interscience, New York
Brekelmans R., Driessen L., Hamers H. and den Hertog D. (2005). Gradient estimation schemes for noisy functions. J. Opt. Theory Appl. 126: 529–551
Chaudhuri P., Diwekar U.: Synthesis approach to the determination of optimal waste blends under uncertainty. 45, 1671–1687 (1999)
Choi T.D. and Kelley C.T. (2000). Superlinear convergence and implicit filtering. SIAM J. Opt. 10: 1149–1162
Davis, E., Ierapetritou, M.: AIChE J. DOI 10.1002/aic.11228 (2007, in press)
Duran M. and Grossmann I. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Prog. 36: 307–339
Floudas C. (1995). Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, New York
Gilmore P. and Kelley C.T. (1995). An implicit filtering algorithm for optimization of functions with many local minima. SIAM J. Opt. 5: 269–285
Goovaaerts P. (1997). Geostatistics for Natural Resources Evolution. Oxford University Press, New York
Goyal, V., Ierapetritou, M.: Stochastic MINLP optimization using simplicial approximation. Comp. Chem. Eng. In Press (2006)
Gutmann H.M. (2001). A radial basis function method for global optimization. J. Global Opt. 19: 201–227
Huyer W. and Neumaier A. (1999). Global optimization by multilevel coordinate search. J. Global Opt. 14: 331–355
Jones D. (2001). A taxonomy of global optimization methods based on response surfaces. J. Global Opt. 21: 345–383
Jones D., Perttunen C. and Stuckman B. (1993). Lipschitzian optimization without the Lipschitz constant. J. Opt. Theory App. 79: 157–181
Jones D., Schonlau M. and Welch W. (1998). Efficient global optimization of expensive black-box functions. J. Global Opt. 13: 455–492
Meyer C., Floudas C. and Neumaier A. (2002). Global optimization with nonfactorable constraints. Ind. Eng. Chem. Res. 41: 6413–6424
Myers R. and Montgomery D. (2002). Response Surface Methodology. Wiley, New York
Regis R. and Shoemaker C. (2007). Improved strategies for radial basis function methods for global optimization. J. Global Opt. 37: 113–135
Sacks J., Welch J.W., Mitchell T.J. and Wynn H.P. (1989). Design and analysis of computer experiments. Stat. Sci. 4: 409–423
Seader J. and Henley E. (2005). Separation Process Principles. Wiley, New York
Storn R. and Price K. (1997). Differential evolution: a simple and efficient adaptive scheme for global optimization over continuous spaces. J. Global Opt. 11: 341–359
Wei J. and Realff J. (2004). Sample average approximation methods for stochastic MINLPs. Comp. Chem. Eng. 28: 333–346
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Davis, E., Ierapetritou, M. A kriging based method for the solution of mixed-integer nonlinear programs containing black-box functions. J Glob Optim 43, 191–205 (2009). https://doi.org/10.1007/s10898-007-9217-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-007-9217-2