Solving a dynamic separation problem using MINLP techniques

DOI10.1016/J.APNUM.2007.01.023MaRDI QIDQ2480935zbMATH OpenOpenAlexFDO

Authors Stefan Emet, Tapio Westerlund

Publication date 7 April 2008

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apnum.2007.01.023

zbMATH Keywords

mixed integer nonlinear programmingextended cutting plane methodchromatographic separation

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• scientific article; zbMATH DE number 5639784
• Mixed-integer nonlinear optimization
• Review of nonlinear mixed-integer and disjunctive programming techniques
• Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
• scientific article; zbMATH DE number 1302169

Cites work

• Encyclopedia of optimization. In 6 vols.
• Integrating SQP and branch-and-bound for mixed integer nonlinear programming
• scientific article; zbMATH DE number 5639784
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(5)

• Optimal configuration, design and operation of hybrid batch distillation/pervaporation processes
• Advances in MINLP to identify energy-efficient distillation configurations
• Une procédure arborescente pour la séparation de mélanges complexes dans l'industrie chimique. Application à un train de colonnes de rectification
• Mixed-integer nonlinear PDE-constrained optimization for multi-modal chromatography
• scientific article; zbMATH DE number 5639784

Describes a project that uses

Uses Software

• AlphaECP

This page was built for publication: Solving a dynamic separation problem using MINLP techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480935)