A Note on Reducing the Number of Variables in IntegerProgramming Problems

Authors:
Nan Zhu;Kevin Broughan
Affiliations:
Department of Mathematics, University of Waikato, Hamilton, New Zealand;Department of Mathematics, University of Waikato, Hamilton, New Zealand
Venue:
Computational Optimization and Applications
Year:
1997

Citing 3
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Reducing the number of variables in integer and linear programming problems

Computational Optimization and Applications

A variable-grouping based genetic algorithm for large-scale integer programming

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.