Inexact solution of NLP subproblems in MINLP
From MaRDI portal
Publication:1942026
DOI10.1007/s10898-012-0010-5zbMath1288.90053OpenAlexW1976080395WikidataQ58040536 ScholiaQ58040536MaRDI QIDQ1942026
Publication date: 25 March 2013
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-0010-5
convexityouter approximationmixed integer nonlinear programminggeneralized Benders decompositioninexactness
Related Items
Inexact feasibility pump for mixed integer nonlinear programming, A decomposition method for MINLPs with Lipschitz continuous nonlinearities, Outer approximation for mixed-integer nonlinear robust optimization
Uses Software
Cites Work
- Unnamed Item
- Heuristics for convex mixed integer nonlinear programs
- Decomposition in general mathematical programming
- An algorithmic framework for convex mixed integer nonlinear programs
- A feasibility pump for mixed integer nonlinear programs
- Partitioning procedures for solving mixed-variables programming problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- Solving mixed integer nonlinear programs by outer approximation
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Generalized Benders decomposition
- A Probing Algorithm for MINLP with Failure Prediction by SVM
- The Cutting-Plane Method for Solving Convex Programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs