Provably Near-Optimal Approximation Algorithms for Operations Management Models

  • Levi R
N/ACitations
Citations of this article
19Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multistage stochastic optimization models arise in various application domains, including central areas of operations management, such as inventory control, supply chain management, and revenue management. Unfortunately, it is usually computationally very hard to find optimal solutions for these fundamental models, and typically even finding good solutions is very challenging, both in theory and practice. In this tutorial, we will survey various relatively new algorithmic and performance analysis techniques that can be applied to some of these models to construct provably near-optimal algorithms, particularly algorithms that admit worst-case performance guarantees. These techniques span ideas from various disciplines, such as optimization, computer science, and stochastic analysis.

Cite

CITATION STYLE

APA

Levi, R. (2010). Provably Near-Optimal Approximation Algorithms for Operations Management Models. In Risk and Optimization in an Uncertain World (pp. 179–192). INFORMS. https://doi.org/10.1287/educ.1100.0076

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free