In a recent paper, [Bellman, Richard. 1956. On the theory of dynamic programming—a warehousing problem. Management Sci. 2 (3, April) 272.], Bellman uses dynamic programming to establish a computational algorithm for the solution of the “warehouse” problem. The present paper also employs the dynamic-programming approach and shows that the structure of the solution can be determined analytically, with numerical results easily obtained via recursive formulas.
No takes yet. Share an insight, caveat, or question.
Stuart E. Dreyfus (1957) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: