DMCA
E.: Logic-based Outer Approximation for Globally Optimal Synthesis of Process Networks (1914)
| Venue: | Computers and Chemical Engineering |
| Citations: | 6 - 1 self |
BibTeX
@ARTICLE{Bergamini14e.:logic-based,
author = {Maria Lorena Bergamini and Pio Aguirre and Ignacio Grossmann},
title = {E.: Logic-based Outer Approximation for Globally Optimal Synthesis of Process Networks},
journal = {Computers and Chemical Engineering},
year = {1914},
volume = {29}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Process network problems can be formulated as Generalized Disjunctive Programs where a logicbased representation is used to deal with the discrete and continuous decisions. A new deterministic algorithm for the global optimization of process networks is presented in this work. The proposed algorithm, which does not rely on spatial branch-and-bound, is based on the Logic-Based Outer Approximation that exploits the special structure of flowsheet synthesis models. The method is capable of considering nonconvexities, while guaranteeing globality in the solution of an optimal synthesis of process network problem. This is accomplished by solving iteratively reduced NLP subproblems to global optimality and MILP master problems, which are valid outer approximations of the original problem. Piecewise linear under and overestimators for bilinear and concave terms have been constructed with the property of having zero gap in a finite set of points. The global optimization of the reduced NLP may be performed either with a suitable global solver or using the inner optimization strategy that is proposed in this work. Theoretical properties are discussed as well as several alternatives for implementing the proposed algorithm. Several examples were successfully solved with this algorithm. Results show that only few
Keyphrases
logic-based outer approximation process network globally optimal synthesis process network problem global optimization special structure global optimality milp master problem several example suitable global solver continuous decision theoretical property original problem generalized disjunctive program valid outer approximation optimal synthesis several alternative concave term flowsheet synthesis model spatial branch-and-bound finite set new deterministic algorithm inner optimization strategy logicbased representation
