Inexact Cuts in Benders Decomposition
From MaRDI portal
Publication:4509730
DOI10.1137/S1052623497318700zbMath0955.90088OpenAlexW2072675086MaRDI QIDQ4509730
Golbon Zakeri, David M. Ryan, Andy B. Philpott
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497318700
Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Linear programming (90C05) Stochastic programming (90C15)
Related Items
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Decomposition based hybrid metaheuristics, Level bundle methods for oracles with on-demand accuracy, Uncontrolled inexact information within bundle methods, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection, An accelerated benders decomposition algorithm for stochastic power system expansion planning using sample average approximation, A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, On generating maximal nondominated Benders cuts, Speed-up Benders decomposition using maximum density cut (MDC) generation, Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach, A decomposition approach to the two-stage stochastic unit commitment problem, Recovery strategies from major supply disruptions in single and multiple sourcing networks, An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming, Logic-Based Benders Decomposition for Large-Scale Optimization, Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems, Inexact Cuts in Stochastic Dual Dynamic Programming Applied to Multistage Stochastic Nondifferentiable Problems, Solving two-stage stochastic programming problems with level decomposition, Accelerating Benders method using covering cut bundle generation, The Benders decomposition algorithm: a literature review, A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method, Optimization of real asset portfolio using a coherent risk measure: Application to oil and energy industries, Divide to conquer: decomposition methods for energy optimization, Multiplier stabilization applied to two-stage stochastic programs, On the convergence of sampling-based decomposition algorithms for multistage stochastic programs, Regularized decomposition of large scale block-structured robust optimization problems, A moment and sum-of-squares extension of dual dynamic programming with application to nonlinear energy storage problems, A new convergent hybrid learning algorithm for two-stage stochastic programs, Inexact Cuts in Stochastic Dual Dynamic Programming, Convexity and optimization with copulæ structured probabilistic constraints, Benders decomposition with adaptive oracles for large scale optimization, Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization, Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis, Acceleration strategies of Benders decomposition for the security constraints power system expansion planning, A nontangential cutting plane algorithm