Constrained Discounted Markov Decision Chains
1991 ◽
Vol 5
(4)
◽
pp. 463-475
◽
Keyword(s):
A Markov decision chain with countable state space incurs two types of costs: an operating cost and a holding cost. The objective is to minimize the expected discounted operating cost, subject to a constraint on the expected discounted holding cost. The existence of an optimal randomized simple policy is proved. This is a policy that randomizes between two stationary policies, that differ in at most one state. Several examples from the control of discrete time queueing systems are discussed.
1987 ◽
Vol 24
(02)
◽
pp. 347-354
◽
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):
2017 ◽
Vol 32
(4)
◽
pp. 626-639
◽
Keyword(s):
Keyword(s):
1994 ◽
Vol 40
(1)
◽
pp. 91-108
◽