Application of average dynamic programming to inventory systems
From MaRDI portal
Publication:1298770
DOI10.1007/BF01198405zbMath0940.90007OpenAlexW2022529355MaRDI QIDQ1298770
Raúl Montes-De-oca, Óscar Vega-Amaya
Publication date: 25 July 2000
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01198405
dynamic programmingaverage costinventory systemsdiscrete-time Markov control processesunbounded costs and controls
Related Items (4)
A perturbation approach to a class of discounted approximate value iteration algorithms with Borel spaces ⋮ Markov control processes with pathwise constraints ⋮ A perturbation approach to approximate value iteration for average cost Markov decision processes with Borel spaces and bounded costs ⋮ Optimal strategies for an inventory system with cost functions of general form
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the vanishing interest rate approach in average Markov decision chains with continuous and bounded costs
- Another set of conditions for average optimality in Markov control processes
- Average optimality in dynamic programming on Borel spaces -- unbounded costs and controls
- Comparing recent assumptions for the existence of average optimal stationary policies
- Discounted and average Markov decision processes with unbounded rewards: New conditions
- Average cost optimal policies for Markov control processes with Borel state space and unbounded costs
- Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs
- Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey
- Average Optimality in Dynamic Programming with General State Space
- A Counterexample on the Semicontinuity of Minima
This page was built for publication: Application of average dynamic programming to inventory systems
