By Topic

Optimal index policies for MDPs with a constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Makowski, A.M. ; Dept. of Electr. Eng., Maryland Univ., College Park, MD ; Schwartz, A.

The search for optimal policies in Markov decision processes (MDPs) is considered. Many controlled queuing systems poses simple index-type optimal policies, when discounted, average, or finite-time cost criteria are considered. For constrained optimization problems, the index structure of the optimal policies is in general not preserved. The authors provide a framework under which the solution of the constrained optimization problem uses the same index policies as the nonconstrained problem. The method is applicable to the discrete-time Klimov system, which is shown to be equivalent to the open bandit problem

Published in:

Decision and Control, 1991., Proceedings of the 30th IEEE Conference on

Date of Conference:

11-13 Dec 1991