Optimizing over the Efficient Set of the binary Bi-objective Knapsack problem

  • Djamal Chaabane Faculty of Mathematics, Department of Operations Research, Laboratory AMCD-RO, USTHB, Bab-Ezzouar, Algiers, Algeria
  • Nadia Lachemi Faculty of Mathematics, Department of Operations Research, Laboratory AMCD-RO, USTHB, Bab-Ezzouar, Algiers, Algeria

Abstract

This paper deals with the problem of optimizing a linear function over the efficient set of a 0/1 bi-objective knapsack problem. Such a function represents the main criterion of the problem posed. The resolution process is based essentially on dynamic programming. The proposed method provides a subset of efficient solutions including one which optimizes the main criterion without having to enumerate all the efficient solutions of the problem. A numerical experiment is reported, different instances with large sizes of the associated efficient sets are considered to show the efficiency of our algorithm compared with a previous algorithm.

Published
Oct 20, 2022
How to Cite
CHAABANE, Djamal; LACHEMI, Nadia. Optimizing over the Efficient Set of the binary Bi-objective Knapsack problem. Yugoslav Journal of Operations Research, [S.l.], oct. 2022. ISSN 2334-6043. Available at: <https://yujor.fon.bg.ac.rs/index.php/yujor/article/view/1017>. Date accessed: 05 dec. 2022. doi: http://dx.doi.org/10.2298/YJOR210915015C.
Section
Research Articles