Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
From MaRDI portal
Publication:1787334
DOI10.1007/s11081-018-9377-6zbMath1397.90331OpenAlexW2790911908MaRDI QIDQ1787334
Achim Kienle, Dennis Michaels, Christian Kunde, Nick Mertens
Publication date: 5 October 2018
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/21.11116/0000-0000-E650-2
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- GLOMIQO: global mixed-integer quadratic optimizer
- Three enhancements for optimization-based bound tightening
- Constraint propagation on quadratic constraints
- SCIP: solving constraint integer programs
- Interval analysis on directed acyclic graphs for global optimization
- An analytical approach to global optimization
- A polyhedral branch-and-cut approach to global optimization
- Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
- Global optimization problems and domain reduction strategies
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Bound reduction using pairs of linear inequalities
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Feasibility-Based Bounds Tightening via Fixed Points
- Branching and bounds tighteningtechniques for non-convex MINLP
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Mixed-integer nonlinear optimization
- Global Optimization and Constraint Satisfaction
This page was built for publication: Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
