Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 54-102
- https://doi.org/10.1007/bfb0121114
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- A tight upper bound for the expectation of a convex function of a multivariate random variablePublished by Springer Nature ,1986
- Modeling and solution strategies for unconstrained stochastic optimization problemsAnnals of Operations Research, 1984
- A Convergence Theory for Saddle FunctionsTransactions of the American Mathematical Society, 1983
- Stochastic Programming: Solution Techniques and Approximation SchemesPublished by Springer Nature ,1983
- Bounds on the value of information in uncertain decision problems IIStochastics, 1983
- Solving stochastic programming problems with recourse including error boundsMathematische Operationsforschung und Statistik. Series Optimization, 1982
- Nonanticipativity and L 1-martingales in stochastic optimization problemsPublished by Springer Nature ,1976
- Stochastic convex programming: basic dualityPacific Journal of Mathematics, 1976
- Variations on a cutting plane method for solving concave minimization problems with linear constraintsNaval Research Logistics Quarterly, 1974
- More bounds on the expectation of a convex function of a random variableJournal of Applied Probability, 1972