Computing optimal (s, S) policies in inventory models with continuous demands

DOI10.2307/1427149zbMath0566.90026OpenAlexW2327551576MaRDI QIDQ3682204

Awi Federgruen, Paul Zipkin

Publication date: 1985

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427149

zbMATH Keywords

AlgorithmsMarkov decision processinventory modelpolicy iterationcontinuous state spaceoptimal policydiscrete demandcontinuous demandcomputation procedures

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Markov and semi-Markov decision processes (90C40)

Related Items (10)

Warehouse-retailer system with stochastic demands -- non-identical retailer case ⋮ A gradient-based method to calculate \((s,S)\) policies ⋮ An (s,r,S) Diffusion Inventory Model with Exponential Leadtimes and Order Cancellations ⋮ ERROR ANALYSIS OF AN APPROXIMATE OPTIMAL POLICY FOR AN INVENTORY SYSTEM WITH STOCHASTIC AND CONTINUOUS DEMANDS ⋮ Optimal \((r,nQ,T)\) batch ordering with quantized supplies ⋮ Optimal and Near-Optimal (s,S) Inventory Policies for Levy Demand Processes ⋮ A dynamic joint replenishment policy with auto-correlated demand ⋮ An (s, k, S) fluid inventory model with exponential leadtimes and order cancellations ⋮ Optimal (r, nQ, T) batch-ordering policy under stationary demand ⋮ A dynamic analysis of the single-item periodic stochastic inventory system with order capacity

This page was built for publication: Computing optimal (s, S) policies in inventory models with continuous demands