Comparisons of solving a chromatographic separation problem using MINLP methods

Computers and Chemical Engineering

Volumn 28, Issue 5, 2004, Pages 673-682

  Emet, Stefan ^a   Westerlund, Tapio ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Branch and Bound; Chromatographic separation; Extended Cutting Plane; Mixed Integer Nonlinear Programming; Outer Approximation

Indexed keywords

BOUNDARY VALUE PROBLEMS; CHROMATOGRAPHIC ANALYSIS; FINITE ELEMENT METHOD; NONLINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SEPARATION;

BRANCH AND BOUND (BB); CHROMATOGRAPHIC SEPARATION; MIXED INTEGER NONLINEAR PROGRAMMING (MINLP); OUTER APPROXIMATION (OA);

CHEMICAL ENGINEERING;

CHROMATOGRAPHY; COMPUTER; MATHEMATICAL ANALYSIS; MODEL; SEPARATION;

ANALYTIC METHOD; CHROMATOGRAPHY; COMPUTER PROGRAM; CONFERENCE PAPER; EVALUATION; INTERMETHOD COMPARISON; MATHEMATICAL MODEL; MOLECULAR DYNAMICS; PRODUCTIVITY; SEPARATION TECHNIQUE;

EID: 1842861958     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.compchemeng.2004.02.010     Document Type: Conference Paper

References (15)

1. Brooke, A., Kendrick, D., Meeraus, A., Raman, R., & Rosenthal, R. E. (1998). GAMS: A user's guide. Washington, DC: GAMS Development Corporation.
2. Ching C.B., Hidajat K., Ruthven D.M. Experimental study of a simulated counter-current adsorption system. V. Comparison of resin and zeolite adsorbents for fructose-glucose separation at high concentration. Chemical Engineering and Science. 40:1987;2547-2555.
3. Drud A. A GRG code for large sparse dynamic nonlinear optimization problems. Mathematical Programming. 31:1985;153-191.
4. Duran M.A., Grossmann I.E. An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming. 36:1986;307-339.
5. Dünnebier G., Klatt K.-U. Optimal operation of simulated moving bed chromatographic processes. Computers and Chemical Engineering Supplement. 23:1999;195-198.
6. Emet, S. (2002). A comparative study of solving a chromatographic separation problem using MINLP methods. Ph.Lic. Thesis, Åbo Akademi University.
7. Guiochon, G., Shirazi, S. G., & Katti, A. M. (1994). Fundamentals of preparative and nonlinear chromatography. San Diego, CA: Academic Press.
8. Karlsson, S. (2001). Optimization of a sequential-simulated moving-bed separation process with mathematical programming methods. Ph.D. Thesis, Åbo Akademi University.
9. Leyffer, S. (1999). User manual for MINLP_BB. Numerical Analysis Report NA/181, Dundee University.
10. Leyffer S. Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming. Computational Optimization and Applications. 18:2001;295-309.
11. Saska M., Clarke S.J., Mei D.W., Khalid I. Application of continuous chromatographic separation in the sugar industry. International Sugar Journal. 93:1991;223-228.
12. Skrifvars H., Leyffer S., Westerlund T. Comparisons of certain MINLP algorithms when applied to a model structure determination and parameter estimation problem. Computers and Chemical Engineering. 22:1998;1829-1835.
13. Strube J., Altenhöner U., Meurer M., Schmidt-Traub H. Optimierung kontinuerlicher simulated-moving-bed chromatographie-prozesse durch dynamische simulation. Chemie Ingenieur Technik. 69:1997;328-331.
14. Westerlund, T., & Lundqvist, K. (2003). Alpha-ECP, version 5.1. An interactive MINLP-solver based on the extended cutting plane method. Report 01-178-A, Process Design Laboratory at Åbo Akademi University.
15. Westerlund T., Pörn R. Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optimization and Engineering. 3:2002;253-280.