Invariant problems in dynamic programming- average reward criterion
A dynamic programming problem is called invariant if its transition mechanism depends only on the action taken and does not depend on the current state of the systm. Replacement and maintenance problems are two typical types of problems which arise in applications and are often invariant. The paper studies properties of invariant problems when the state space is arbitrary and the action space is finite. The main result is a method of obtaining optimal policies for this case when the optimality criterion is that of maximizing the average reward per unit time. Results are illustrated by examples.
Year of publication: |
1980
|
---|---|
Authors: | Assaf, David |
Published in: |
Stochastic Processes and their Applications. - Elsevier, ISSN 0304-4149. - Vol. 10.1980, 3, p. 313-322
|
Publisher: |
Elsevier |
Keywords: | Average reward optimal policy dynamic programming optimality equation average reward invariant problems [beta]-optimal policy |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Optimal Group Maintenance Policies with Continuous and Periodic Inspections
Assaf, David, (1987)
-
Assaf, David, (2002)
-
Optimal cooperative stopping rules for maximization of the product of the expected stopped values
Assaf, David, (1998)
- More ...