Dynamic programming solution of allocation problems.

Stuart E. Dreyfus

Expert InsightsPublished 1957

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.

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1957
  • Pages: 13
  • Document Number: P-1083

Citation

Chicago Manual of Style

Dreyfus, Stuart E., Dynamic programming solution of allocation problems. Santa Monica, CA: RAND Corporation, 1957. https://www.rand.org/pubs/papers/P1083.html.
BibTeX RIS

This publication is part of the RAND paper series. The paper series was a product of RAND 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.

RAND 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.