An iterative method for approximating average cost optimal (s,S) inventory policies

DOI10.1007/BF02026603zbMath0291.90029OpenAlexW1993683267MaRDI QIDQ4042819

Henk C. Tijms

Publication date: 1974

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02026603

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (1)

Contraction mappings underlying undiscounted Markov decision problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic programming, Markov chains, and the method of successive approximations
• Computing Optimal (s, S) Inventory Policies
• Étude asymptotique des systèmes markoviens à commande
• On (s, S) Policies
• On the Opimality of $( {s,S} )$ Inventory Policies: New Conditions and a New Proof
• On Finding the Maximal Gain for Markov Decision Processes
• Technical Note—Bounds on the Gain of a Markov Decision Process

This page was built for publication: An iterative method for approximating average cost optimal (s,S) inventory policies