A Fully Polynomial-Time Approximation Scheme for Single-Item Stochastic Inventory Control with Discrete Demand

DOI10.1287/moor.1090.0391zbMath1231.90030WikidataQ59592335 ScholiaQ59592335MaRDI QIDQ3169059

Jim Orlin, David Simchi-Levi, Mohamed Mostagir, Diego Klabjan, Nir Halman

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1090.0391

zbMATH Keywords

stochastic dynamic programming; approximation algorithms; stochastic inventory management

Mathematics Subject Classification ID

90C15: Stochastic programming

90C59: Approximation methods and heuristics in mathematical programming

90B05: Inventory, storage, reservoirs

90C39: Dynamic programming

Related Items

Toward Breaking the Curse of Dimensionality: An FPTAS for Stochastic Dynamic Programs with Multidimensional Actions and Scalar States, Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models, A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy, Calculating target inventory levels for constrained production: a fast simulation-based approximation, Stochastic lot-sizing problem with inventory-bounds and constant order-capacities, Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks, Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints, The stochastic lot-sizing problem with quantity discounts, Stochastic lot sizing problem with nervousness considerations, On the complexity of energy storage problems, The TV advertisements scheduling problem, Bi-criteria path problem with minimum length and maximum survival probability, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, The finite horizon investor problem with a budget constraint, Near-Optimal Algorithms for the Assortment Planning Problem Under Dynamic Substitution and Stochastic Demand, Optimality Gap of Constant-Order Policies Decays Exponentially in the Lead Time for Lost Sales Models, Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times