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.
|Date of creation:||Feb 1996|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.htmlEmail:
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Stein W. Wallace & Stein-Erik Fleten, 2002. "Stochastic programming in energy," GE, Growth, Math methods 0201001, EconWPA, revised 13 Nov 2003.
- Lucchetti, R. & Salinetti, G. & Wets, R. J. B., 1994. "Uniform Convergence of Probability Measures: Topological Criteria," Journal of Multivariate Analysis, Elsevier, vol. 51(2), pages 252-264, November.
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:wp96020. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.