Discrete Dynamic Programming and Capital Allocation

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.127, 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.151, 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.

[1]  L. J. Savage,et al.  Three Problems in Rationing Capital , 1955 .

[2]  A. Land,et al.  An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.

[3]  Stanley Reiter,et al.  Choosing an Investment Program among Interdependent Projects , 1963 .

[4]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[5]  H. Weingartner,et al.  Mathematical Programming and the Analysis of Capital Budgeting Problems. , 1964 .

[6]  F. Glover.  A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem , 1965 .

[7]  E. Balas.  An Additive Algorithm for Solving Linear Programs with Zero-One Variables , 1965 .

[8]  George L. Nemhauser,et al.  Introduction To Dynamic Programming , 1966 .

[9]  S. Reiter,et al.  Discrete Optimizing Solution Procedures for Linear and Nonlinear Integer Programming Problems , 1966 .

[10]  H. Weingartner.  Capital Budgeting of Interrelated Projects: Survey and Synthesis , 1966 .

[11]  Seymour Kaplan.  Solution of the Lorie-Savage and Similar Integer Programming Problems by the Generalized Lagrange Multiplier Method , 1966, Oper. Res..

[12]  H. Joksch.  The shortest route problem with constraints , 1966 .

[13]  P. Kolesar.  A Branch and Bound Algorithm for the Knapsack Problem , 1967 .

[14]  A. M. Geoffrion.  IMPLICIT ENUMERATION USING AN IMBEDDED LINEAR PROGRAM , 1967 .

[15]  Clifford C. Petersen,et al.  Computational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects , 1967 .

[16]  George L. Nemhauser,et al.  Letter to the Editor - A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem , 1968, Oper. Res..