Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint
From MaRDI portal
Publication:2947228
DOI10.1137/140967519zbMath1327.90143arXiv1506.08091OpenAlexW1667969928WikidataQ57931885 ScholiaQ57931885MaRDI QIDQ2947228
Publication date: 22 September 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08091
Related Items
On solving nonsmooth mixed-integer nonlinear programming problems by outer approximation and generalized benders decomposition ⋮ On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition in general mathematical programming
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability
- Benders' decomposition for the constrained \(\ell_ 1\)-problem
- Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
- An algorithmic framework for convex mixed integer nonlinear programs
- Partitioning procedures for solving mixed-variables programming problems
- Lagrangean decomposition for integer nonlinear programming with linear constraints
- Convex functions, monotone operators and differentiability
- Solving mixed integer nonlinear programs by outer approximation
- Ideal, weakly efficient solutions for vector optimization problems
- Logic-based Benders decomposition
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- 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
- Planning and Scheduling by Logic-Based Benders Decomposition
- A generalized Benders decomposition approach to reactive source planning in power systems
- On the Existence of Pareto Efficient Points
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
