Non-asymptotic con dence bounds for the optimal value of a stochastic program
Carregando...
Data
2016
Orientador(res)
Métricas
Título da Revista
ISSN da Revista
Título de Volume
Resumo
We discuss a general approach to building non-asymptotic con dence bounds for stochastic optimization problems. Our principal contribution is the observation that a Sample Average Approximation of a problem supplies upper and lower bounds for the optimal value of the problem which are essentially better than the quality of the corresponding optimal solutions. At the same time, such bounds are more reliable than \standard" con dence bounds obtained through the asymptotic approach. We also discuss bounding the optimal value of MinMax Stochastic Optimization and stochastically constrained problems. We conclude
with a simulation study illustrating the numerical behavior of the proposed bounds.