Note--An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects

Nemhauser and Ullmann (1969) proposed a discrete dynamic programming (DP) approach for several variations of the basic capital allocation model, including one in which the returns and resource consumption of projects are interdependent. For this case, we augment their DP approach with a branch-and-b...

Full description

Saved in:
Bibliographic Details
Published in:Management science 1991-09, Vol.37 (9), p.1195-1200
Main Authors: Carraway, Robert L, Schmidt, Robert L
Format: Article
Language:English
Subjects:
branch and bound
capital budgeting
dynamic programming
project selection
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Nemhauser and Ullmann (1969) proposed a discrete dynamic programming (DP) approach for several variations of the basic capital allocation model, including one in which the returns and resource consumption of projects are interdependent. For this case, we augment their DP approach with a branch-and-bound strategy as suggested in Morin and Marsten (1976). Computational results demonstrate that this enhancement significantly reduces required computation time and effectively removes any limit on the number of nonzero interaction terms allowed. We also demonstrate that our approach compares favorably to an alternative implicit enumeration approach proposed by Hansen (1972).
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.37.9.1195