Explore BrainMass

Quantitative analysis: Integer programming.

See attached file.

Johnston Investments is considering a couple of investment possibilities. Each investment considered will draw on the capital account during each of its first 3 years. In the long run, each investment is predicted to have a positive NPV. Posted in the spreadsheet are the investment choices, its NPV's, and capital requirements. Amounts are in thousands of dollars. In addition, the amount of capital available to the investments in each of the next three years is predicted to be $12 million each year. The goal of Johnston Investments is to maximize the total NPV, which is the sum of NPV's of the investments chosen.

a) Assume that any combination of the investments is permitted, which ones should Perry choose to maximize NPV?
b) What is the value of the total NPV given by your answer in part a?
c) Suppose that the expansion investments (one-phase expansion and two-phase expansion) are mutually exclusive (i.e. only one of them can be made). How does this alter the solution in part a?
d) What is the value of the total NPV in part c?
e) *Ignore parts c and e in this question* Suppose that the test market cannot be carried out unless the advertising campaign is also adopted. Which investments should Johnston choose to maximize NPV given this extra condition?
f) What is the value of the total NPV in part e?


Solution Summary

The problem set deals with using integer programming to maximize selected information with constraints.