Abstract
This study utilizes a primal based generalized geometric programming algorithm for the optimal design of a model absorber-stripper process. The GGP algorithm reduces the generalized geometric program to a convex, linear program by two sequential condensation procedures and a logarithmic transformation. Although inactive Inequality constraints and arbitrary variable bounds were easily accommodated by the algorithm, considerable effort was required to activate the inequality constraints which required an equality condition. The GGP algorithm converged to a local minimum from arbitrary starting points for approximately 60% of the trials. © 1981, American Chemical Society. All rights reserved.
Recommended Citation
D. R. Hoerner and O. K. Crosser, "Application Of Generalized Geometric Programming In Preliminary Plant Design," Industrial and Engineering Chemistry Process Design and Development, vol. 20, no. 2, pp. 210 - 219, American Chemical Society, Apr 1981.
The definitive version is available at https://doi.org/10.1021/i200013a006
Department(s)
Chemical and Biochemical Engineering
International Standard Serial Number (ISSN)
0196-4305
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2023 American Chemical Society, All rights reserved.
Publication Date
01 Apr 1981
