Metric Entropy and Nonasymptotic Confidence Bands in Stochastic Programming

Pflug GC (1996). Metric Entropy and Nonasymptotic Confidence Bands in Stochastic Programming. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-96-034


Download (362kB) | Preview


Talagrand has demonstrated in his key paper, how the metric entropy of a class of functions relates to uniform bounds for the law of large numbers. This paper shows how to calculate the metric entropy of classes of functions which appear in stochastic optimization problems. As a consequence of these results, we derive via variational inequalities confidence bands for the solutions, which are valid for any sample size. In particular, the linear recourse problem is considered.

Item Type: Monograph (IIASA Working Paper)
Research Programs: Optimization under Uncertainty (OPT)
Depositing User: IIASA Import
Date Deposited: 15 Jan 2016 02:08
Last Modified: 13 Mar 2018 14:41

Actions (login required)

View Item View Item

International Institute for Applied Systems Analysis (IIASA)
Schlossplatz 1, A-2361 Laxenburg, Austria
Phone: (+43 2236) 807 0 Fax:(+43 2236) 71 313