Non-convex nested Benders decomposition
From MaRDI portal
Publication:2097672
DOI10.1007/s10107-021-01740-0zbMath1506.90207OpenAlexW4205861130MaRDI QIDQ2097672
Christian Füllner, Steffen Rebennack
Publication date: 14 November 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-021-01740-0
global optimizationnested Benders decompositionmixed integer nonlinear programming (MINLP)non-convexitiesnon-convex value functions
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Decomposition methods (49M27)
Related Items (1)
Uses Software
Cites Work
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- Exact augmented Lagrangian duality for mixed integer linear programming
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- Partitioning procedures for solving mixed-variables programming problems
- Multi-stage stochastic optimization applied to energy planning
- Cut sharing for multistage stochastic linear programs with interstage dependency
- Convex extensions and envelopes of lower semi-continuous functions
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver
- Dynamic convexification within nested Benders decomposition using Lagrangian relaxation: an application to the strategic bidding problem
- A polyhedral branch-and-cut approach to global optimization
- Integer and mixed-integer programming models: General properties
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables
- Stochastic dual dynamic integer programming
- The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
- Generalized Benders decomposition
- Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions
- Julia: A Fresh Approach to Numerical Computing
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Variational Analysis
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Mixed-integer nonlinear optimization
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- JuMP: A Modeling Language for Mathematical Optimization
This page was built for publication: Non-convex nested Benders decomposition
