The design of optimal mixtures from atom groups using Generalized Disjunctive Programming
File(s)1-s2.0-S0098135418300401-main.pdf (858.48 KB)
Published version
Author(s)
Jonuzaj, S
Gupta, Aparana
Adjiman, CSJ
Type
Journal Article
Abstract
A comprehensive computer-aided mixture/blend design methodology for formulating a gen-
eral mixture design problem where the number, identity and composition of mixture constituents
are optimized simultaneously is presented in this work. Within this approach, Generalized Dis-
junctive Programming (GDP) is employed to model the discrete decisions (number and identities
of mixture ingredients) in the problems. The identities of the components are determined by
designing molecules from UNIFAC groups. The sequential design of pure compounds and blends,
and the arbitrary pre-selection of possible mixture ingredients can thus be avoided, making it
possible to consider large design spaces with a broad variety of molecules and mixtures. The
proposed methodology is first applied to the design of solvents and solvent mixtures for max-
imising the solubility of ibuprofen, often sought in crystallization processes; next, antisolvents
and antisolvent mixtures are generated for minimising the solubility of the drug in drowning out
crystallization; and finally, solvent and solvent mixtures are designed for liquid-liquid extraction.
The GDP problems are converted into mixed-integer form using the big-M approach. Integer
cuts are included in the general models leading to lists of optimal solutions which often contain
a combination of pure and mixed solvents.
eral mixture design problem where the number, identity and composition of mixture constituents
are optimized simultaneously is presented in this work. Within this approach, Generalized Dis-
junctive Programming (GDP) is employed to model the discrete decisions (number and identities
of mixture ingredients) in the problems. The identities of the components are determined by
designing molecules from UNIFAC groups. The sequential design of pure compounds and blends,
and the arbitrary pre-selection of possible mixture ingredients can thus be avoided, making it
possible to consider large design spaces with a broad variety of molecules and mixtures. The
proposed methodology is first applied to the design of solvents and solvent mixtures for max-
imising the solubility of ibuprofen, often sought in crystallization processes; next, antisolvents
and antisolvent mixtures are generated for minimising the solubility of the drug in drowning out
crystallization; and finally, solvent and solvent mixtures are designed for liquid-liquid extraction.
The GDP problems are converted into mixed-integer form using the big-M approach. Integer
cuts are included in the general models leading to lists of optimal solutions which often contain
a combination of pure and mixed solvents.
Date Issued
2018-08-04
Date Acceptance
2018-01-23
Citation
Computers and Chemical Engineering, 2018, 116, pp.401-421
ISSN
1873-4375
Publisher
Elsevier
Start Page
401
End Page
421
Journal / Book Title
Computers and Chemical Engineering
Volume
116
Sponsor
Engineering & Physical Science Research Council (EPSRC)
Engineering & Physical Science Research Council (EPSRC)
Grant Number
EP/J003840/1
Doctoral Prize - Jonuzaj
Subjects
0904 Chemical Engineering
0913 Mechanical Engineering
Chemical Engineering
Publication Status
Published
Date Publish Online
2018-02-03