Stochastic programming by Monte Carlo simulation methods

Abstract

We consider in this paper stochastic programming problems which can be formulated as an optimization problem of an expected value function subject to deterministic constraints. We discuss a Monte Carlo simulation approach based on sample average approximations to a numerical solution of such problems. In particular, we give a survey of a statistical inference of the sample average estimators of the optimal value and optimal solutions of the true problem. We also discuss stopping rules and a validation analysis for such sample average approximation optimization procedures and give some illustration examples.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 73 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.