Dynamic programming algorithms are developed for optimal capital allocation subject to budget constraints. We extend the work of Weingartner 17 and Weingartner and Ness 19 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.
%0 Journal Article
%1 nemhauser
%A Nemhauser, G. L.
%A Ullmann, Z.
%D 1969
%I INFORMS
%J Management Science
%K knapsack smoothed-analysis
%N 9
%P pp. 494-505
%R 10.1287/mnsc.15.9.494
%T Discrete Dynamic Programming and Capital Allocation
%U http://www.jstor.org/stable/2628385
%V 15
%X Dynamic programming algorithms are developed for optimal capital allocation subject to budget constraints. We extend the work of Weingartner 17 and Weingartner and Ness 19 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.
@article{nemhauser,
abstract = {Dynamic programming algorithms are developed for optimal capital allocation subject to budget constraints. We extend the work of Weingartner [17] and Weingartner and Ness [19] 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.},
added-at = {2012-12-13T02:43:20.000+0100},
author = {Nemhauser, G. L. and Ullmann, Z.},
biburl = {https://www.bibsonomy.org/bibtex/26ee9dfb31d412a587ccc5b3021f4b784/ytyoun},
doi = {10.1287/mnsc.15.9.494},
interhash = {07734b8b57a79879d39dbbc2f77c9116},
intrahash = {6ee9dfb31d412a587ccc5b3021f4b784},
issn = {00251909},
journal = {Management Science},
jstor_articletype = {research-article},
jstor_formatteddate = {May, 1969},
jstor_issuetitle = {Theory Series},
keywords = {knapsack smoothed-analysis},
language = {English},
number = 9,
pages = {pp. 494-505},
publisher = {INFORMS},
timestamp = {2012-12-13T02:51:09.000+0100},
title = {Discrete Dynamic Programming and Capital Allocation},
url = {http://www.jstor.org/stable/2628385},
volume = 15,
year = 1969
}