Inequalities in completely convex stochastic programming
From MaRDI portal
Cites work
- Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming
- Convexity and conditional expectations
- scientific article; zbMATH DE number 3561077 (Why is no real title available?)
- scientific article; zbMATH DE number 3588383 (Why is no real title available?)
- scientific article; zbMATH DE number 3246773 (Why is no real title available?)
- scientific article; zbMATH DE number 3291751 (Why is no real title available?)
- scientific article; zbMATH DE number 3320765 (Why is no real title available?)
- scientific article; zbMATH DE number 3096290 (Why is no real title available?)
- Inequalities for Stochastic Nonlinear Programming Problems
- Measurable selections of extrema
- On a problem of convexity and its applications to nonlinear stochastic programming
- Sharp Bounds on the Value of Perfect Information
- Stochastic convex programming: basic duality
- Stochastic Programs with Recourse
- Technical Note—The Continuity of the Perturbation Function of a Convex Program
- The Value of Information and Stochastic Programming
This page was built for publication: Inequalities in completely convex stochastic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1146111)