Tuning reaction products by constrained optimisation
We describe an effective means of defining optimisation criteria for self-optimising reactors, applicable to situations where a compromise is sought between several competing objectives. The problem is framed as a constrained optimisation, in which a lead property is optimised subject to constraints...
Saved in:
Published in | Reaction chemistry & engineering Vol. 2; no. 5; pp. 785 - 798 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Cambridge
Royal Society of Chemistry
01.10.2017
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | We describe an effective means of defining optimisation criteria for self-optimising reactors, applicable to situations where a compromise is sought between several competing objectives. The problem is framed as a constrained optimisation, in which a lead property is optimised subject to constraints on the values that other properties may assume. Compared to conventional methods (using weighted-sum- and weighted-product-based merit functions), the approach described here is more intuitive, easier to implement, and yields an optimised solution that more faithfully reflects user preferences. The method is applied here to the synthesis of
o
-xylenyl adducts of Buckminsterfullerene, using a cascadic reaction of the form X
0
→ X
1
→ X
2
→ … X
N
. Specifically, we selectively target the formation of the (technologically useful) first- and second-order adducts X
1
and X
2
, while at the same time suppressing the formation of unwanted higher-order products. More generally, the approach is applicable to any chemical optimisation involving a trade-off between competing criteria. To assist with implementation we provide a self-contained software package for carrying out constrained optimisation, together with detailed tutorial-style instructions. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 2058-9883 2058-9883 |
DOI: | 10.1039/C7RE00123A |