Reduction of bounded variables in integer linear programming problems

Abdelkrim Rezzag, Mohand Ouamer Bibi and Abdelhek Laouar

International Journal of Mathematics in Operational Research, 2025, vol. 30, issue 2, 251-265

Abstract: In this paper, we suggest a new technique for reducing the number of variables in general integer linear programming problems with bounded variables. This technique involves fixing certain variables of the problem's optimal solution at one of their bounds, either lower or upper. A numerical illustrative example is presented, numerical experiments have been conducted to compare the execution time of the original problem with the execution time of the reduced problem and the presolving procedure.

Keywords: integer linear programming; bounded variables; presolving procedure; numerical results and comparisons. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=145608 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:30:y:2025:i:2:p:251-265

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().