EconPapers    
Economics at your fingertips  
 

A branch-and-cut technique to solve multiobjective integer quadratic programming problems

Fatma Zohra Ouaïl () and Mohamed El-Amine Chergui ()
Additional contact information
Fatma Zohra Ouaïl: USTHB
Mohamed El-Amine Chergui: USTHB

Annals of Operations Research, 2018, vol. 267, issue 1, No 21, 446 pages

Abstract: Abstract This article proposes an exact method to solve the integer programming problem featuring several convex quadratic functions to be minimized (henceforth denoted by MOIQP). The proposed algorithm is a branch and bound based technique suitable for MOIQP problems to generate the set of all efficient solutions. The features of the method are as follows. First, the branch and bound technique allows solving the relaxed problem according to any linear function and progressively generates integer solutions. Then, the efficient cut proposed reduces the search area by truncating domains containing non efficient solutions without having to enumerate them. Finally, at each node of the tree search, three fathoming rules are used to enhance the speed of the procedure. Computational experiments are presented in order to analyze the performance of the algorithm.

Keywords: Multiobjective optimization; Quadratic programming; Branch and bound; Efficient cuts; Multiobjective quadratic integer programming; 90C29; 90C20; 90C57; 90C10 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2698-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:annopr:v:267:y:2018:i:1:d:10.1007_s10479-017-2698-6

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2698-6

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:annopr:v:267:y:2018:i:1:d:10.1007_s10479-017-2698-6