Augmentation approaches for Mixed Integer Programming

This paper analyses the feasible sets structure of general mixed integer linear programs (MIPs) and its relationship with the existence of a finite cardinality test set which can be applied in augmentation algorithms. We derive and characterize a computable, finite test set for MIPs which can be embedded in a finite augmentation algorithm. Several examples illustrate the structure of this set and its relationship with previous approaches in the literature.