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

In the multidimensional 0-1 knapsack problem, we are given a set of items, each with a value and multiple attributes, and we want to select a subset in such a way that the total value is maximized ...