Solving MINLP containing noisy variables and black-box functions using Branch-and-Bound
暂无分享,去创建一个
[1] Sven Leyffer,et al. Solving mixed integer nonlinear programs by outer approximation , 1994, Math. Program..
[2] A. M. Geoffrion. Generalized Benders decomposition , 1972 .
[3] David Kendrick,et al. GAMS, a user's guide , 1988, SGNM.
[4] R. Raman,et al. Modelling and computational techniques for logic based integer programming , 1994 .
[5] R. H. Myers,et al. Response Surface Methodology: Process and Product Optimization Using Designed Experiments , 1995 .
[6] I. Grossmann. Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques , 2002 .
[7] Bernard Gendron,et al. Parallel Branch-and-Branch Algorithms: Survey and Synthesis , 1994, Oper. Res..
[8] Marianthi G. Ierapetritou,et al. Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization , 2004, Comput. Chem. Eng..
[9] Ignacio E. Grossmann,et al. An outer-approximation algorithm for a class of mixed-integer nonlinear programs , 1986, Math. Program..
[10] Ignacio E. Grossmann,et al. Systematic Methods of Chemical Process Design , 1997 .