Question: 5. Formulate the following problem as an integer programming model and solve it with branch and bound: Four projects are available for investment. The projects

5. Formulate the following problem as an integer programming model and solve it with branch and bound: Four projects are available for investment. The projects require the cash flows and yield the net present values (NPV) that are shown in millions in the Table. If $6 is available for investment at time 0, find the investment plan that maximizes NPV. Cash Outflow at Time 0 ($) Project NPV ($) 1 3 5 2 5 8 3 3 2. 4 4 7
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
