Solving a dynamic separation problem using MINLP techniques
From MaRDI portal
Publication:2480935
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
- Modeling and optimization of a dynamic separation process using mixed integer nonlinear programming
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(5)- Mixed-integer nonlinear PDE-constrained optimization for multi-modal chromatography
- Advances in MINLP to identify energy-efficient distillation configurations
- Optimal configuration, design and operation of hybrid batch distillation/pervaporation processes
- Une procédure arborescente pour la séparation de mélanges complexes dans l'industrie chimique. Application à un train de colonnes de rectification
- Modeling and optimization of a dynamic separation process using mixed integer nonlinear programming
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)