On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse
AbstractIntegrals of optimal values of random linear programming problems depending on a finite dimensional parameter are approximated by using empirical distributions instead of the original measure. Uniform convergence of the approximations is proved under fairly broad conditions allowing non-convex or discontinuous dependence on the parameter value and random size of the linear programming problem.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by International Institute for Applied Systems Analysis in its series Working Papers with number wp95003.
Date of creation: Jan 1995
Date of revision:
Contact details of provider:
Postal: A-2361 Laxenburg
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral 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.