.png){kind=icon}
Return
Linear programming formulations for attainable region analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/S0009-2509(02)00101-X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
formulations
linear programming
mixing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.3
Papers:
2.3W
Citations:
5.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveOptimal reactor design from a geometric viewpoint .1. Universal properties of the attainable region
OAAI
OAAIShareSaveShareSaveShareSave
View more