Discrete Dynamic Programming and Capital Allocation

G. L. Nemhauser and Z. Ullmann
Additional contact information
G. L. Nemhauser: The Johns Hopkins University
Z. Ullmann: Stanford Research Institute, Menlo Park, California

Management Science, 1969, vol. 15, issue 9, 494-505

Abstract: Dynamic programming algorithms are developed for optimal capital allocation subject to budget constraints. We extend the work of Weingartner [Weingartner, H. M. 1966. Capital budgeting of interrelated projects: Survey and synthesis. Management Sci. 12(7, March) 485-516.] and Weingartner and Ness [Weingartner, H. M., D. N. Ness. 1967. Methods for the solution of the multi-dimensional 0/1 knapsack problem. Oper. Res. 15(1, January-February) 83-108.] by including multilevel projects, reinvesting returns, borrowing and lending, capital deferrals, and project interactions. We are able to handle dynamic programming models with several state variables because the optimal returns are monotone non-decreasing step functions. Computational experience with a variety of problems is reported.

Date: 1969
References: Add references at CitEc
Citations: View citations in EconPapers (19)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.15.9.494 (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:ormnsc:v:15:y:1969:i:9:p:494-505

Access Statistics for this article

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