Algorithm for solution of convex MINLP problems

MaRDI QIDQ2383445zbMATH OpenFDO

Authors E. C. Pereira, A. R. Secchi

Publication date 19 September 2007

Published in Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

branch and bound searchmixed-integer nonlinear programmingoptimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
• An algorithmic framework for MINLP with separable non-convexity
• An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs

Cited in

(7)

• An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems
• An algorithmic framework for MINLP with separable non-convexity
• scientific article; zbMATH DE number 5871159 (Why is no real title available?)
• scientific article; zbMATH DE number 3889289 (Why is no real title available?)
• Improving the performance of DICOPT in convex MINLP problems using a feasibility pump

Describes a project that uses

Uses Software

• GAMS
• CONOPT

This page was built for publication: Algorithm for solution of convex MINLP problems

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