Author
Listed:
- C. S. Adjiman
(Princeton University, Department of Chemical Engineering)
- C. A. Schweiger
(Princeton University, Department of Chemical Engineering)
- C. A. Floudas
(Princeton University, Department of Chemical Engineering)
Abstract
The use of networks allows the representation of a variety of important engineering problems. The treatment of a particular class of network applications, the process synthesis problem, is exposed in this paper. Process Synthesis seeks to develop systematically process flowsheets that convert raw materials into desired products. In recent years, the optimization approach to process synthesis has shown promise in tackling this challenge. It requires the development of a network of interconnected units, the process superstructure, that represents the alternative process flowsheets. The mathematical modeling of the superstructure has a mixed set of binary and continuous variables and results in a Mixed-Integer optimization model. Due to the nonlinearity of chemical models, these problems are generally classified as Mixed-Integer Nonlinear Programming (MINLP) problems. A number of local optimization algorithms, developed for the solution of this class of problems, are presented in this paper: Generalized Benders Decomposition (GBD), Outer Approximation (OA), Generalized Cross Decomposition (GCD), Branch and Bound (BB), Extended Cutting Plane (ECP), and Feasibility Approach (FA). Some recent developments for the global optimization of nonconvex MINLPs are then introduced. In particular, two branch-and-bound approaches are dis-cussed:the Special structure Mixed Integer Nonlinear αBB (SMIN-αBB), where the binary variables should participate linearly or in mixed-bilinear terms, and the General structure Mixed Integer Nonlinear αBB (GMIN- αBB), where the continuous relaxation of the binary variables must lead to a twice-differentiable problem. Both algorithms are based on the αBB global optimization algorithm for nonconvex continuous problems. Once the theoretical issues behind local and global optimization algorithms for MINLPs have been exposed, attention is directed to their algorithmic development and implementation. The framework MINOPT is discussed as a computational tool for the solution of process synthesis problems. It is an implementation of a number of local optimization algorithms for the solution of MINLPs. The use of MINOPT is illustrated through the solution of a variety of process network problems. The synthesis problem for a heat exchanger network is then presented to demonstrate the global optimization SMIN-αBB algorithm.
Suggested Citation
C. S. Adjiman & C. A. Schweiger & C. A. Floudas, 1998.
"Mixed-Integer Nonlinear Optimization in Process Synthesis,"
Springer Books, in: Ding-Zhu Du & Panos M. Pardalos (ed.), Handbook of Combinatorial Optimization, pages 1-76,
Springer.
Handle:
RePEc:spr:sprchp:978-1-4613-0303-9_1
DOI: 10.1007/978-1-4613-0303-9_1
Download full text from publisher
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below whether another version of this item is available online.
2. Check on the provider's
web page
whether it is in fact available.
3. Perform a
for a similarly titled item that would be
available.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4613-0303-9_1. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.