.png){kind=icon}
返回
A parametric mixed-integer optimization algorithm for multiobjective engineering problems involving discrete decisions
.png){kind=icon}
PRE
AI
DOI：10.1021/ie970720n.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An iterative, decomposition-based algorithm is proposed in this paper, for the solution of convex parametric MINLP problems and, in extension, the identification of the noninferior solution set in multiobjective problems involving continuous and discrete decisions. The parametric optimal solution is constructed via an upper- and lower-bound procedure. Parametric upper bounds are identified with the solution of parametric NLP problems, while the parametric lower bound is updated in each iteration via the solution of a parametric MILP Master problem, which involves only the binary variables of the initial problem. Convergence properties and computational requirements are discussed in example problems from process synthesis under uncertainty and simultaneous product/process design.
Keyword:
DESIGN
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.9
论文数:
4.0W
被引数:
9.6W
机构
暂无机构信息
引用论文
The pharmacokinetics of orbifloxacin in the horse following oral and intravenous administration
PREAI
分享收藏Structured correspondence topic models for mining captioned figures in biological literature.png)
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
OAAI
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data miningIF0
OAAI分享收藏
查看更多内容