Subgradient decomposition and differentiability of the recourse function of a two stage stochastic linear program
From MaRDI portal
Publication:688928
DOI10.1016/0167-6377(93)90003-YzbMath0778.90047OpenAlexW1985932945MaRDI QIDQ688928
Publication date: 1 November 1993
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(93)90003-y
approximationsdifferentiability of the recourse functionsubgradient decompositiontwo stage stochastic linear program
Related Items
Multicut Benders decomposition algorithm for process supply chain planning under uncertainty, An interval-parameter fuzzy two-stage stochastic program for water resources management under uncertainty, Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic convex programming: basic duality
- Lifting projections of convex polyhedra
- Linear Programming under Uncertainty
- Solving stochastic programs with simple recourse
- On the interchange of subdifferentiation and conditional expectation for convex functionals
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming