| Abstract |
: |
Given a linear integer program: max{/b cx/: /b Ax/=/b b/, /b x/>or=0 and integer}, /b A/ rational, it is known that it can be solved in theory for all values of /b c/, either by testing a finite number of solutions for optimality, or by adding a finite number of valid inequalities, each generated from a superadditive function, and solving the resulting linear program. The main result is to show that (analogously) the integer program can be solved for all values of /b b /, either by testing a finite number of solutions for feasibility and optimality, or by adding a finite number of valid inequalities, each generated from a superadditive function and solving the resulting linear program. |
