9.1 Introduction to Integer Programming

← Back to document page

TABLE 1 ables the optimal combination to obtain a higher NPV than any combination that includes invest ment 1. If, as in Chapter 3, fractional investments were allowed, the optimal solution to (9) would be x\ = .v> = 1, .v3 = 0.50, xA = 0, z = 544,000, and investment 1 would be used. This simple ex

  Table, Fractional