Accession Number:

AD0668760

Title:

FINDING OPTIMAL POLICIES IN DISCRETE DYNAMIC PROGRAMMING,

Descriptive Note:

Corporate Author:

RAND CORP SANTA MONICA CALIF

Personal Author(s):

Report Date:

1968-04-01

Pagination or Media Count:

18.0

Abstract:

The problem considered is the discrete time multichain decision problem introduced and largely solved by Howard Dynamic Programming and Markov Processes, Technology Press and John Wiley Sons, Inc., New York 1960. A policy iteration algorithm is developed that obtains an optimal stationary policy for the discount problem involving all discount factors sufficiently close to one. These are the policies that Blackwell has termed optimal and has proved existed. The algorithm is excellent for a decisionmaker who knows that he should use a low discount rate but doesnt know what it should be. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE