Constrained Average Cost Markov Decision Chains

doi:10.1017/s0269964800002795

Constrained Average Cost Markov Decision Chains

2009-07-27

0

PRE

AI

DOI：10.1017/s0269964800002795

原文链接

原文求助

摘要

En 中文

A Markov decision chain with denumerable state space incurs two types of costs — for example, an operating cost and a holding cost. The objective is to minimize the expected average operating cost, subject to a constraint on the expected average holding cost. We prove the existence of an optimal constrained randomized stationary policy, for which the two stationary policies differ on at most one state. The examples treated are a packet communication system with reject option and a single-server queue with service rate control.

Constrained Average Cost Markov Decision Chains

摘要

AI总结

期刊

机构

引用论文