Skip to main content
SpringerLink
Log in

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

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.A. Babayev and S.S. Mardanov, "Reducing the number of variables in integer and linear programming problems," Comput. Optim. Appl., vol. 3, pp. 99–109, 1994.

    Google Scholar 

  2. K. Broughan, C. McKenzie, A. Sneyd, and Y. Wang, "Optimal hydropower generation scheduling for a cascade," IMA Journal of Mathematics Applied in Business & Industry, vol. 5, pp. 115–130, 1993/1994.

    Google Scholar 

  3. K. Dudziński, "A note on dominance relation in unbounded knapsack problems," Opns. Res. Lett., vol. 10, pp. 417–419, 1991.

    Google Scholar 

  4. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley: Chichester, 1990.

    Google Scholar 

  5. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, Wiley: New York, 1988.

    Google Scholar 

  6. D. Pisinger, "Dominance relations in unbounded knapsack problems," Tech. Rep. No. 94/33, DIKU, Copenhagen, Denmark.

  7. H.P. Williams, "The elimination of integer variables," J. Opns. Res. Soc., vol. 5, pp. 387–393, 1992.

    Google Scholar 

  8. N. Zhu and K. Broughan, "On dominated terms in the general knapsack problem," The 31st Annual Conference of OR Society ofNew Zealand, Wellington, Aug. 31-Sept. 1, 1995.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Waikato, Hamilton, New Zealand

    Nan Zhu & Kevin Broughan

Authors
  1. Nan Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kevin Broughan
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, N., Broughan, K. A Note on Reducing the Number of Variables in Integer Programming Problems. Computational Optimization and Applications 8, 263–272 (1997). https://doi.org/10.1023/A:1008675522511

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008675522511

Search

Navigation