Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
From MaRDI portal
Publication:3757691
DOI10.1287/MOOR.12.1.149zbMATH Open0619.90053OpenAlexW2083661799WikidataQ92155371 ScholiaQ92155371MaRDI QIDQ3757691FDOQ3757691
Authors: John R. Birge, Roger J.-B. Wets 
Publication date: 1987
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.12.1.149
Recommendations
Inequalities; stochastic orderings (60E15) Stochastic programming (90C15) Distribution theory (60E99)
Cited In (36)
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Algorithms for the solution of stochastic dynamic minimax problems
- Restricted-recourse bounds for stochastic linear programming
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Uncertainties in minimax stochastic programs
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
- Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models
- Barycentric bounds in stochastic programming: theory and application
- Multistage stochastic programming: Error analysis for the convex case
- Robust analysis in stochastic simulation: computation and performance guarantees
- Continuous approximation schemes for stochastic programs
- Total variation bounds on the expectation of periodic functions with applications to recourse approximations
- On the safe side of stochastic programming: bounds and approximations
- Generalized decision rule approximations for stochastic programming via liftings
- A numerical method for solving stochastic programming problems with moment constraints on a distribution function
- Parallel processors for planning under uncertainty
- Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
- Robust defibrillator deployment under cardiac arrest location uncertainty via row-and-column generation
- Robust optimization with ambiguous stochastic constraints under mean and dispersion information
- Title not available (Why is that?)
- An upper bound for SLP using first and total second moments
- Sublinear upper bounds for stochastic programs with recourse
- Title not available (Why is that?)
- Stability and sensitivity-analysis for stochastic programming
- Monotonic bounds in multistage mixed-integer stochastic programming
- Aggregation and discretization in multistage stochastic programming
- Convergent bounds for stochastic programs with expected value constraints
- Multiperiod portfolio optimization with terminal liability: bounds for the convex case
- Bounding separable recourse functions with limited distribution information
- Stochastic programs with recourse: An upper bound and the related moment problem
- An upper bound on the expectation of simplicial functions of multivariate random variables
- Bounding multi-stage stochastic programs from above
- Applying the minimax criterion in stochastic recourse programs
- Process flexibility: a distribution-free bound on the performance of \(k\)-chain
- Computing upper bounds for a LBPP with and without probabilistic constraints
- Barycentric scenario trees in convex multistage stochastic programming
This page was built for publication: Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3757691)
