More bounds on the expectation of a convex function of a random variable
From MaRDI portal
Publication:5658871
DOI10.2307/3212616zbMATH Open0246.60011OpenAlexW2315735804MaRDI QIDQ5658871FDOQ5658871
Authors: Aharon Ben-Tal, Eithan Hochman
Publication date: 1972
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3212616
Probability distributions: general theory (60E05) Axioms; other general questions in probability (60A05)
Cited In (22)
- Tight tail probability bounds for distribution-free decision making
- Uncertainties in minimax stochastic programs
- On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor
- The minimax approach to stochastic programming and an illustrative application
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- The interface between OR/MS and decision theory
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- On the safe side of stochastic programming: bounds and approximations
- A multi-objective distributionally robust model for sustainable last mile relief network design problem
- A distributionally robust analysis of the program evaluation and review technique
- Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
- Restricted recourse strategies for bounding the expected network recourse function
- Analyzing process flexibility: a distribution-free approach with partial expectations
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Bounding separable recourse functions with limited distribution information
- Guaranteed Bounds for General Nondiscrete Multistage Risk-Averse Stochastic Optimization Programs
- An upper bound on the expectation of simplicial functions of multivariate random variables
- Distributionally robust equilibrium for continuous games: Nash and Stackelberg models
- Frameworks and results in distributionally robust optimization
- Approximation from Noisy Data
- Robust Optimization with Ambiguous Stochastic Constraints Under Mean and Dispersion Information
- MAD Dispersion Measure Makes Extremal Queue Analysis Simple
This page was built for publication: More bounds on the expectation of a convex function of a random variable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5658871)