On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse and Extensions.
Integrals of optimal values of random optimization problems depending on a finite dimensional parameter are approximated by using empirical distributions instead of the original measure. Under fairly broad conditions, it is proved that uniform convergence of empirical approximations of the right hand sides of the constraints implies uniform convergence of the optimal values in the linear and convex case.
Year of publication: |
1996-02
|
---|---|
Authors: | Pflug, G.C. ; Ruszczynski, A. ; Schultz, R. |
Institutions: | International Institute for Applied Systems Analysis (IIASA) |
Saved in:
freely available
Saved in favorites
Similar items by person
-
On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse.
Pflug, G.C., (1995)
-
Configurations of Series-Parallel Networks with Maximum Reliability.
Gutjahr, W., (1993)
-
A Branch and Bound Method for Stochastic Global Optimization.
Norkin, V.I., (1996)
- More ...