Tighter relaxations in mixed-integer nonlinear programming

DOI10.14279/DEPOSITONCE-9889MaRDI QIDQ6631290zbMATH OpenFDO

Authors Benjamin Müller

Publication date 1 November 2024

Full work available at URL https://doi.org/10.14279/DEPOSITONCE-9889

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Convex relaxations for mixed-integer nonlinear programs
• On generalized surrogate duality in mixed-integer nonlinear programming
• On generalized surrogate duality in mixed-integer nonlinear programming
• Mixed-integer nonlinear optimization
• Branching and bounds tighteningtechniques for non-convex MINLP

This page was built for publication: Tighter relaxations in mixed-integer nonlinear programming

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