Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T13:10:03.675Z Has data issue: false hasContentIssue false

Optimality conditions for a Markov decision chain with unbounded costs

Published online by Cambridge University Press:  14 July 2016

D. R. Robinson*
Affiliation:
University of Manchester
*
∗ Postal address: Statistical Laboratory, Department of Mathematics, The University, Manchester M13 9PL, U.K.

Abstract

It is known that when costs are unbounded satisfaction of the appropriate dynamic programming ‘optimality' equation by a policy is not sufficient to guarantee its average optimality. A ‘lowest-order potential' condition is introduced which, along with the dynamic programming equation, is sufficient to establish the optimality of the policy. Also, it is shown that under fairly general conditions, if the lowest-order potential condition is not satisfied there exists a non-memoryless policy with smaller average cost than the policy satisfying the dynamic programming equation.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable