Kinetic Bounds on Attainability in the Reactor Synthesis Problem
Author(s) -
T. Abraham,
Martin Feinberg
Publication year - 2003
Publication title -
industrial and engineering chemistry research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.878
H-Index - 221
eISSN - 1520-5045
pISSN - 0888-5885
DOI - 10.1021/ie030497w
Subject(s) - bounding overwatch , hyperplane , polygon (computer graphics) , mixing (physics) , set (abstract data type) , product (mathematics) , upper and lower bounds , space (punctuation) , computer science , mathematics , mathematical optimization , combinatorics , physics , mathematical analysis , geometry , telecommunications , frame (networking) , artificial intelligence , quantum mechanics , programming language , operating system
Given a chemical reaction network (with kinetics) and given a specified feed, we ask which product compositions are attainable from the feed by means of processes that employ only reaction and mixing. Although there has been considerable attention to this question recently, much of the “attainable region” research has focused on building the set of realizable compositions “from the inside”, that is, by attempting to extend a set of already realized compositions with further reaction and mixing. Here we seek to bound the set of attainable compositions “from the outside” by construction of a bounding polygon in composition space, within which all attainable compositions must reside. The polygon construction proceeds by what we call the method of bounding hyperplanes. When the number of hyperplanes employed becomes large, the resulting polygonal bound can, at least in some instances, approximate the actual attainable region sharply.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom