Note: This problem requires the use of a linear programming application such as Solver or Analytic Solver.

A firm has prepared the following binary integer program to evaluate a number of potential new capital projects. The firm's goal is to maximize the net present value of their decision while not spending more than their currently available capital.

$[Constraint1\}[Constraint2\}[Constraint3\}[Constraint5\}$

$x_j=\{\begin{array}{ccc}1,& if\text{p}\text{r}\text{o}\text{j}\text{e}\text{c}\text{t}jis\text{s}\text{e}\text{l}\text{e}\text{c}\text{t}\text{e}\text{d}& \end{array}$

$0,$ otherwise

Set up the problem in Excel and find the optimal solution. Which projects are selected?