The models in this chapter are often called combinatorial models because each solution is a combination of the various 0’s and 1’s, and only a finite number of such combinations exist. For the capital...

The models in this chapter are often called combinatorial models because each solution is a combination of the various 0’s and 1’s, and only a finite number of such combinations exist. For the capital budgeting model in Figure 6.1, there are 7 investments, so there are 27  128 possible solutions (some of which are infeasible). This is a fairly large number, but not too large. Solve the model without Solver by listing all 128 solutions. For each, calculate the requirement and total NPV for the model. Then manually choose the one that stays within the budget and has the largest NPV.