Procedure for obtaining finite-state approximations to uncountable-state dynamic programs when the state space need not be compact. Except in rare cases, it is necessary to discretize uncountable-state dynamic programs to obtain even an approximate solution. This paper describes a procedure for discretizing dynamic programs which begins by assuming that the state space is compact; a finite grid is constructed so that any point in the space is in the neighborhood of a grid point. The problem is then to find conditions such that the approximations converge to the solution of the original problem as the mesh becomes finer. A two-step approximation procedure is developed for a space that is not compact. The result obtained here complements the analogous result in RM-6195 for denumerable-state programs. 7 pp. Ref.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.