
Accession Number : AD0704567
Title : FINITESTATE APPROXIMATIONS TO DENUMERABLESTATE DYNAMIC PROGRAMS,
Corporate Author : RAND CORP SANTA MONICA CALIF
Personal Author(s) : Fox,B. L.
Report Date : FEB 1970
Pagination or Media Count : 18
Abstract : The paper presents a description of a sequence of policies for essentially finitestate dynamic programs with applications to Air Force inventory control problems. The work considers the case in dynamic programming where the domain and range is the space of denumerable sequences. To obtain a sequence of finitestate approximations, the problem is expressed in a manner essentially equivalent to that of an nstate problem, achieved by 'cutting off the tail' of the original problem. Policies are defined for essentially finitestate dynamic programs such that the corresponding vector of optimal returns converges pointwise to that of a denumerablestate dynamic program. This result implies that when the number of states in the approximating program is large, the exact number does not matter significantly, say in determining supply and stockage policies. A corresponding result is also given for stochastic games.
Descriptors : (*AIR FORCE OPERATIONS, LOGISTICS), (*INVENTORY CONTROL, DYNAMIC PROGRAMMING), (*DYNAMIC PROGRAMMING, APPROXIMATION(MATHEMATICS)), INVENTORY CONTROL, DECISION MAKING, STOCHASTIC PROCESSES, GAME THEORY, ALGORITHMS, CONVERGENCE
Subject Categories : Administration and Management
Operations Research
Logistics, Military Facilities and Supplies
Distribution Statement : APPROVED FOR PUBLIC RELEASE