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 ...

This paper shows how branch-and-bound methods can be used to reduce storage and, possibly, computational requirements in discrete dynamic programs. Relaxations and fathoming criteria are used to ...