.png){kind=icon}
返回
Mixed-integer dynamic optimization I: problem formulation
.png){kind=icon}
PRE
AI
DOI：10.1016/S0098-1354(98)00294-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A rigorous decomposition approach is presented for mixed-integer dynamic optimization problems. The approach combines dynamic optimization with insight based targeting techniques to decompose the optimization into subproblems providing rigorous upper and lower bounds on the objective. This approach has the potential to eliminate total enumeration of the discrete space, assures termination in a finite number of iterations and yields a rigorous bound on the distance between the solution found and the global solution. (C) 1999 Elsevier Science Ltd. All rights reserved.
Keyword:
GENERALIZED BENDERS DECOMPOSITION
GLOBAL OPTIMIZATION
BATCH DISTILLATION
PATH CONSTRAINTS
SYSTEMS
DESIGN
UNCERTAINTY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容