.png){kind=icon}
返回
Linear programming formulations for attainable region analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/S0009-2509(02)00101-X.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose linear programming (LP) models for attainable region (AR) analysis by considering a rate vector field in concentration space with an arbitrarily large number of points. One model provides a method to construct candidate ARs using a fully connected network of continuously stirred tank reactors (CSTRs) of arbitrary volume. More importantly, these methods are extended to derive linear programming conditions that are stronger necessary conditions than have proposed previously by Glasser and Hildebrandt. We state the LP condition as: No combination of nonzero volume CSTRs, operating at discretized points in the complement of the candidate AR, can extend the region. We demonstrate these proposed linear programming techniques on several two-dimensional reaction mechanisms and then apply the LP methods to verify extensions for a previously published three-dimensional candidate AR. (C) 2002 Elsevier Science Ltd. All rights reserved.
Keyword:
formulations
linear programming
mixing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
2.3W
被引数:
5.5W
机构
暂无机构信息
引用论文
.png){kind=icon}
Optimal reactor design from a geometric viewpoint .1. Universal properties of the attainable region
OAAI
OAAI分享收藏
查看更多内容