arXiv:1711.06803 [math.OC]AbstractReferencesReviewsResources
Reduction of total-cost and average-cost MDPs with weakly continuous transition probabilities to discounted MDPs
Eugene A. Feinberg, Jefferson Huang
Published 2017-11-18Version 1
This note describes sufficient conditions under which total-cost and average-cost Markov decision processes (MDPs) with general state and action spaces, and with weakly continuous transition probabilities, can be reduced to discounted MDPs. For undiscounted problems, these reductions imply the validity of optimality equations and the existence of stationary optimal policies. The reductions also provide methods for computing optimal policies. The results are applied to a capacitated inventory control problem with fixed costs and lost sales.
Categories: math.OC
Related articles: Most relevant | Search more
arXiv:1507.00664 [math.OC] (Published 2015-07-02)
On the Reduction of Total-Cost and Average-Cost MDPs to Discounted MDPs
arXiv:1202.4122 [math.OC] (Published 2012-02-19)
Average-Cost Markov Decision Processes with Weakly Continuous Transition Probabilities
arXiv:1902.10685 [math.OC] (Published 2019-02-27)
On the Minimum Pair Approach for Average-Cost Markov Decision Processes with Countable Discrete Action Space and Strictly Unbounded Costs