Optimization Online


Monte Carlo Sampling-Based Methods for Stochastic Optimization

Tito Homem-de-Mello (tito.hmello***at***uai.cl)
Guzin Bayraksan (bayraksan.1***at***osu.edu)

Abstract: This paper surveys the use of Monte Carlo sampling-based methods for stochastic optimization problems. Such methods are required when—as it often happens in practice—the model involves quantities such as expectations and probabilities that cannot be evaluated exactly. While estimation procedures via sampling are well studied in statistics, the use of such methods in an optimization context creates new challenges such as ensuring convergence of optimal solutions and optimal values, testing optimality conditions, choosing appropriate sample sizes to balance the effort between optimization and estimation, and many other issues. Much work has been done in the literature to address these questions. The purpose of this paper is to give an overview of some of that work, with the goal of introducing the topic to students and researchers and providing a practical guide for someone who needs to solve a stochastic optimization problem with sampling.

Keywords: Monte Carlo methods: stochastic optimization; sample average approximation

Category 1: Stochastic Programming

Category 2: Other Topics (Optimization of Simulated Systems )

Citation: Surveys in Operations Research and Management Science 19 (2014), 56-85

Download: [PDF]

Entry Submitted: 06/12/2013
Entry Accepted: 06/13/2013
Entry Last Modified: 07/02/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society