.png){kind=icon}
返回
A global optimization algorithm for nonconvex generalized disjunctive programming and applications to process systems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0098-1354(01)00732-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A global optimization algorithm for nonconvex Generalized Disjunctive Programming (GDP) problems is proposed in this paper. By making use of convex underestimating functions for bilinear, linear fractional and concave separable functions in the continuous variables, the convex hull of each nonlinear disjunction is constructed. The relaxed convex GDP problem is then solved in the first level of a two-level branch and bound algorithm, in which a discrete branch and bound search is performed on the disjunctions to predict lower bounds. In the second level, a spatial branch and bound method is used to solve nonconvex NLP problems for updating the upper bound. The proposed algorithm exploits the convex hull relaxation for the discrete search, and the fact that the spatial branch and bound is restricted to fixed discrete variables in order to predict tight lower bounds. Application of the proposed algorithm to several example problems is shown, as well as a comparison with other algorithms. (C) 2001 Elsevier Science Ltd. All rights reserved.
Keyword:
nonconvex GDP
nonconvex MINLP
convex hull relaxation
branch and bound
global optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏The effects of crosslink density on thermo-mechanical properties of shape-memory hydro-epoxy resin
PREAI
分享收藏
分享收藏
查看更多内容