Approximate multi-parametric programming based B&B algorithm for MINLPs
Approximate multi-parametric programming based B&B algorithm for MINLPs
复制标题
基于B的近似多参数规划
DOI:
10.1016/j.compchemeng.2012.03.001
复制
发表时间:
2012
影响因子:
4.3
通讯作者:
Gueddar T
中科院分区:
文献类型:
--
作者:
Gueddar T
In this work an improved B&B algorithm for MINLPs is proposed. The basic idea of the proposed algorithm is to treat binary variables as parameters and obtain the solution of the resulting multi-parametric NLP (mp-NLP) as a function of the binary variables, relaxed as continuous variables, at the root node of the search tree. It is recognized that solving the mp-NLP at the root node can be more computationally expensive than exhaustively enumerating all the terminal nodes of the tree. Therefore, only a local approximate parametric solution, and not a complete map of the parametric solution, is obtained and it is then used to guide the search in the tree.
登录
查看更多内容
影响因子:
4.3
作者:
V. Goyal;M. Ierapetritou
通讯作者:
M. Ierapetritou
影响因子:
4.3
作者:
V. Goyal;M. Ierapetritou
通讯作者:
M. Ierapetritou
DOI:
--
发表时间:
1999
期刊:
影响因子:
--
作者:
V. Dua;E. Pistikopoulos
通讯作者:
E. Pistikopoulos
DOI:
--
发表时间:
2006
期刊:
影响因子:
--
作者:
V. Dua
通讯作者:
V. Dua
影响因子:
2.7
作者:
R. Jackson;G. McCormick
通讯作者:
G. McCormick