Some advances in decomposition methods for stochastic linear programming

DOI10.1023/A:1018965626303zbMath0919.90119OpenAlexW80788423MaRDI QIDQ1289300

Ruszczyński, Andrzej

Publication date: 28 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018965626303

zbMATH Keywords

splitting methodsdual methodsaugmented Lagrangianprimal methodscutting plane methodslinear multi-stage stochastic programming

Mathematics Subject Classification ID

Linear programming (90C05) Stochastic programming (90C15)

Related Items (5)

On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems ⋮ Two-stage stochastic, large-scale optimization of a decentralized energy system: a case study focusing on solar PV, heat pumps and storage in a residential quarter ⋮ Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems ⋮ On the implementation of a log-barrier progressive hedging method for multistage stochastic programs ⋮ Multiplier stabilization applied to two-stage stochastic programs

This page was built for publication: Some advances in decomposition methods for stochastic linear programming