It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers.

Recently the application of contingent claims analysis and dynamic programming to project evaluation has attracted a lot of attention. These techniques are required, for example, if the value of a ...