Accession Number:

AD0648000

Title:

MULTICHAIN MARKOV RENEWAL PROGRAMS,

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1967-02-01

Pagination or Media Count:

39.0

Abstract:

Two methods are presented for computing optimal decision sequences and their cost functions. The first method, called policy iteration, is an adaption of an iterative scheme that is widely used for sequential decision problems. The second method is to specify a linear programming problem whose solution determines an optimal policy and its cost function. A third solution technique is shown to apply to certain, but not all, of these Markov renewal programs. As a byproduct of the development, new techniques are provided for solving a broad class of shortest-route problems. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE