Designing a majorization scheme for the recourse function in two-stage stochastic linear programming
From MaRDI portal
Publication:2366830
DOI10.1007/BF00248764zbMath0780.90073OpenAlexW2037779394MaRDI QIDQ2366830
Publication date: 25 August 1993
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00248764
Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Stochastic programming (90C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Sublinear upper bounds for stochastic programs with recourse
- Bounding separable recourse functions with limited distribution information
- An upper bound on the expectation of simplicial functions of multivariate random variables
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- A piecewise linear upper bound on the network recourse function
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Preprocessing in Stochastic Programming: The Case of Linear Programs
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Algorithms for frames and lineality spaces of cones
- Convex Analysis
- Stochastic Programs with Recourse
This page was built for publication: Designing a majorization scheme for the recourse function in two-stage stochastic linear programming