GLOBAL OPTIMIZATION OF NONCONVEX MINLPS

Authors
SMITH EMB PANTELIDES C
Citation
Emb. Smith et C. Pantelides, GLOBAL OPTIMIZATION OF NONCONVEX MINLPS, Computers & chemical engineering, 21, 1997, pp. 791-796
Citations number
21
Categorie Soggetti
Computer Application, Chemistry & Engineering","Engineering, Chemical","Computer Science Interdisciplinary Applications
Journal title
Computers & chemical engineering → ACNP
ISSN journal
00981354
Volume
21
Year of publication
1997
Supplement
S
Pages
791 - 796
Database
ISI
SICI code
0098-1354(1997)21:<791:GOONM>2.0.ZU;2-5
Abstract
The recent advances in mathematical programming approaches applied to process design and operation problems have produced a need for the abi lity to find the global optimum of a nonconvex problem containing disc rete: variables (a nonconvex MINLP). This paper presents a modified ve rsion of the reformulation/spatial branch-and-bound algorithm of Smith and Pantelides (1996) for the solution of such problems. The algorith m is implemented within the gPROMS modelling environment (Barton and P antelides, 1994) and tested on several MINLP problems arising from pro cess engineering applications.