Comparisons of solving a chromatographic separation problem using MINLP methods

In the present paper, comparisons of solving a cyclic chromatographic separation problem using Mixed Integer Nonlinear Programming (MINLP) methods are presented. The dynamics of the chromatographic separation process is modeled as a boundary value problem that is solved, repeatedly within the optimi...

Full description

Saved in:
Bibliographic Details
Published in:Computers & chemical engineering 2004-05, Vol.28 (5), p.673-682
Main Authors: Emet, Stefan, Westerlund, Tapio
Format: Article
Language:English
Subjects:
Branch and Bound
Chromatographic separation
Extended Cutting Plane
Mixed Integer Nonlinear Programming
Outer Approximation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the present paper, comparisons of solving a cyclic chromatographic separation problem using Mixed Integer Nonlinear Programming (MINLP) methods are presented. The dynamics of the chromatographic separation process is modeled as a boundary value problem that is solved, repeatedly within the optimization, using a relatively fast and numerically robust finite difference method. The MINLP methods considered are the Extended Cutting Plane (ECP), the Branch and Bound (BB), and the Outer Approximation (OA) methods. The comparisons indicate the advantages of the ECP method that needs relatively few function evaluations. The results also show that the total efficiency of traditional OA and BB methods, that solves a sequence of Nonlinear Programming (NLP) subproblems, is substantially degradated in these kinds of optimization problems involving both a combinatorial task and time-consuming numerical evaluations.
ISSN:0098-1354
1873-4375
DOI:10.1016/j.compchemeng.2004.02.010