Solution of an integer linear programming problem via a primal dual method combined with a heuristic
by Mohand Ouamer Bibi; Houria Boussouira; Abdelhek Laouar
International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO), Vol. 12, No. 1, 2022

Abstract: In this paper, we propose an algorithm for solving integer linear programming (ILP) problem with upper and lower bounded variables where we combined a cutting plane method with a heuristic. At each iteration, a relaxed problem is solved by the adaptive method and its optimal solution is submitted to a judicious rounding procedure. The concept of β-optimality is used to indicate the quality of the approximate solution obtained by this heuristic. In order to compare our method with the intlinprog method of the MATLAB optimisation toolbox, numerical experiments on randomly generated test problems are presented.

Online publication date: Mon, 20-Dec-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematical Modelling and Numerical Optimisation (IJMMNO):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com