59
16

An Introductory Note to Sample Average Approximation

Abstract

The sample average approximation method to stochastic combinatorial optimization is a powerful technique for approximating last scale stochastic optimization problems. In this tutorial we introduce this technique and we present several examples that demonstrate how to apply this technique to chance-constrained optimization problems.

View on arXiv
Comments on this paper