Bounding separable recourse functions with limited distribution information
From MaRDI portal
Publication:1178445
DOI10.1007/BF02204821zbMath0745.90054OpenAlexW2075399433MaRDI QIDQ1178445
Publication date: 26 June 1992
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02204821
Related Items
Designing a majorization scheme for the recourse function in two-stage stochastic linear programming ⋮ Technical Note—Ranking Distributions When Only Means and Variances Are Known ⋮ Applying optimization theory to study extremal \(GI/GI/1\) transient mean waiting times ⋮ On the safe side of stochastic programming: bounds and approximations ⋮ An upper bound on the expectation of simplicial functions of multivariate random variables ⋮ Estimating the throughput of a cyclic assembly system ⋮ Robust Actuarial Risk Analysis ⋮ Applying the minimax criterion in stochastic recourse programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sublinear upper bounds for stochastic programs with recourse
- Bounds on the value of information in uncertain decision problems II
- Admissible Solutions of the Covariant Two-Body Problem
- Bounds on the Expectation of a Convex Function of a Multivariate Random Variable
- Stochastic Optimization Problems with Incomplete Information on Distribution Functions
- An implementation of a discretization method for semi-infinite programming
- A tight upper bound for the expectation of a convex function of a multivariate random variable
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem
- A piecewise linear upper bound on the network recourse function
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- Solving SLP Recourse Problems with Arbitrary Multivariate Distributions—The Dependent Case
- Extreme Points of Convex Sets in Infinite Dimensional Spaces
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Technical Note—Minimax Procedure for a Class of Linear Programs under Uncertainty
- Discrete Approximations of Probability Distributions
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- Solving stochastic programming problems with recourse including error bounds
- Extreme Points of Certain Sets of Probability Measures, with Applications
- The General Moment Problem, A Geometric Approach
- Convex Analysis
- More bounds on the expectation of a convex function of a random variable
