A Global Optimization Strategy and Its Use in Solvent Design

DOI10.1007/0-387-30927-6_1MaRDI QIDQ5427970zbMATH OpenOpenAlexFDO

Authors Manish Sinha, Luke E. K. Achenie, G. M. Ostrovskij

Publication date 27 November 2007

Published in Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/0-387-30927-6_1

zbMATH Keywords

branch-and-boundbranching functionMINLPsolvent designspecial tree function

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Branching and bounds tighteningtechniques for non-convex MINLP
• On branching rules for convex mixed-integer nonlinear optimization
• Mixed-integer nonlinear optimization
• Review of nonlinear mixed-integer and disjunctive programming techniques
• scientific article; zbMATH DE number 1302169

Cited in

(5)

• Interval global optimization in solvent design
• Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns
• scientific article; zbMATH DE number 1101491 (Why is no real title available?)
• scientific article; zbMATH DE number 5499355 (Why is no real title available?)
• Global Optimization and Constraint Satisfaction

This page was built for publication: A Global Optimization Strategy and Its Use in Solvent Design

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