Decomposition algorithms for stochastic programming on a computational grid
From MaRDI portal
Abstract: We describe algorithms for two-stage stochastic linear programming with recourse and their implementation on a grid computing platform. In particular, we examine serial and asynchronous versions of the L-shaped method and a trust-region method. The parallel platform of choice is the dynamic, heterogeneous, opportunistic platform provided by the Condor system. The algorithms are of master-worker type (with the workers being used to solve second-stage problems, and the MW runtime support library (which supports master-worker computations) is key to the implementation. Computational results are presented on large sample average approximations of problems from the literature.
Recommendations
- Analysis of stochastic problem decomposition algorithms in computational grids
- On a distributed implementation of a decomposition method for multistage linear stochastic programs
- Computational assessment of distributed decomposition methods for stochastic linear programs
- Computational grids for stochastic programming
- Scalable parallel Benders decomposition for stochastic linear programming
Cited in
(64)- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Order Scheduling Models: Hardness and Algorithms
- Analysis of stochastic problem decomposition algorithms in computational grids
- A regularized simplex method
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- Computational study of decomposition algorithms for mean-risk stochastic linear programs
- Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables
- Inverse Mixed Integer Optimization: Polyhedral Insights and Trust Region Methods
- The Benders decomposition algorithm: a literature review
- Stabilized Benders decomposition for energy planning under climate uncertainty
- The impact of sampling methods on bias and variance in stochastic linear programs
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- Computational assessment of distributed decomposition methods for stochastic linear programs
- A warm-start approach for large-scale stochastic linear programs
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- Solving a class of stochastic mixed-integer programs with branch and price
- A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption
- Challenges in Enterprise Wide Optimization for the Process Industries
- Parallelizable preprocessing method for multistage stochastic programming problems
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling
- Parallel distributed-memory simplex for large-scale stochastic LP problems
- Enhancements of two-stage stochastic decomposition
- Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- Meta-heuristics for Grid Scheduling Problems
- Adaptive multicut aggregation for two-stage stochastic linear programs with recourse
- On parallelization of a stochastic dynamic programming algorithm for solving large-scale mixed \(0-1\) problems under uncertainty
- Computational grids for stochastic programming
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
- Mitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction
- Efficient Stochastic Programming in Julia
- Asynchronous Lagrangian scenario decomposition
- A stochastic programming approach for supply chain network design under uncertainty
- Efficient solution selection for two-stage stochastic programs
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- A trust region method for the solution of the surrogate dual in integer programming
- An effective heuristic for multistage linear programming with a stochastic right-hand side
- Recoverable robust single day aircraft maintenance routing problem
- An improved L-shaped method for solving process flexibility design problems
- The empirical behavior of sampling methods for stochastic programming
- Parallel Scenario Decomposition of Risk-Averse 0-1 Stochastic Programs
- Some insights into the solution algorithms for SLP problems
- Convexity and decomposition of mean-risk stochastic programs
- A version of bundle trust region method with linear programming
- A management system for decompositions in stochastic programming
- Efficient batch job scheduling in grids using cellular memetic algorithms
- An ADMM algorithm for two-stage stochastic programming problems
- Dynamic sequencing and cut consolidation for the parallel hybrid-cut nested L-shaped method
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty
- On parallelizing dual decomposition in stochastic integer programming
- The million-variable ``march for stochastic combinatorial optimization
- Exploiting structure in parallel implementation of interior point methods for optimization
- An embarrassingly parallel method for large-scale stochastic programs
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Preemptive rerouting of airline passengers under uncertain delays
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- The Benders by batch algorithm: design and stabilization of an enhanced algorithm to solve multicut Benders reformulation of two-stage stochastic programs
- jInv -- a flexible Julia package for PDE parameter estimation
- Reformulation and sampling to solve a stochastic network interdiction problem
- A simple version of bundle method with linear programming
- An asynchronous parallel benders decomposition method for stochastic network design problems
- An enhanced L-shaped method for optimizing periodic-review inventory control problems modeled via two-stage stochastic programming
This page was built for publication: Decomposition algorithms for stochastic programming on a computational grid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1866131)
