Letter to the Editor—Note on Computing Optimum Discrete Allocations

Henry A. Young
Additional contact information
Henry A. Young: Sylvania Electronic Systems, Waltham, Massachusetts

Operations Research, 1965, vol. 13, issue 3, 499-503

Abstract: The object of this Note is to extend the discussion of the recursive (dynamic programming) solution of discrete allocation problems found in the first two chapters of Bellman and Dreyfus, Applied Dynamic Programming , Princeton University Press, 1962. These problems frequently involve a continuous state space, characterizing a total amount of resource, and optimum return and policy functions that can change over small segments of this space. In order to compute these functions recursively, it is necessary to replace the continuous space by a discrete grid and compute values of the functions on this grid. The possibility of rapid changes in these functions makes impossible the accurate interpolation of values of an optimum partial return function from those of its predecessor if the grid is chosen arbitrarily. Instead, when problem constants are positive rational numbers, there is a unique grid size that essentially scales the problem to a minimum equivalent solvable all-integer problem.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.3.499 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:13:y:1965:i:3:p:499-503

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().