ISSN:
1573-2878
Keywords:
Integer programming
;
disjunctive constraints
;
polyhedral annexation
;
cutting planes
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Any optimization problem in a finite structure can be represented as an integer or mixed-integer program in integral quantities. We show that, when an optimization problem on an unbounded structure has such a representation, it is very close to a linear programming problem, in the specific sense described in the following results. We also show that, if an optimization problem has such a representation, no more thann+2 equality constraints need be used, wheren is the number of variables of the problem. We obtain a necessary and sufficient condition for a functionf:S→Z, withS $$ \subseteq $$ Z n , to have a rational model in Meyer's sense, and show that Ibaraki models are a proper subset of Meyer models.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00935492
Permalink
