A Note on Reducing the Number of Variables in Integer Programming Problems

A necessary and sufficient condition for identification of dominatedcolumns, which correspond to one type of redundant integer variables,in the matrix of a general Integer Programming problem, isderived. The given condition extends our recent work on eliminatingdominated integer variables in Knapsack problems, and revises arecently published procedure for reducing the number of variables ingeneral Integer Programming problems given in the literature. Areport on computational experiments for one class of large scaleKnapsack problems, illustrating the function of this approach, isincluded.