Title: Reduction of bounded variables in integer linear programming problems

Authors: Abdelkrim Rezzag; Mohand Ouamer Bibi; Abdelhek Laouar

Addresses: Research Unit LaMOS, University of Bejaia, Bejaia, 06000, Algeria ' Research Unit LaMOS, University of Bejaia, Bejaia, 06000, Algeria ' Research Unit LaMOS, University of Bejaia, Bejaia, 06000, Algeria

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.

DOI: 10.1504/IJMOR.2025.145608

International Journal of Mathematics in Operational Research, 2025 Vol.30 No.2, pp.251 - 265

Received: 27 Jul 2023
Accepted: 01 Aug 2023
Published online: 09 Apr 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article