A discussion of the solution of allocation problems by means of the functional equation technique of dynamic programming. Dynamic programming is applied to static problems where allocation of a resource or resources is made to a variety of independent activities at a particular time. The formulation and computational solution of a simplified model is considered and then generalized to a more complex model. Numerical results are attained for the second model by use of the Lagrange multiplier approach.
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.
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.