Optimizing over the efficient set of the binary bi-objective knapsack problem

Autor:	Chaabane Djamal, Lachemi Nadia
Jazyk:	angličtina
Rok vydání:	2023
Předmět:	multiple objective programming bi-objective knapsack problem dynamic programming efficient set optimal solution Management information systems T58.6-58.62
Zdroj:	Yugoslav Journal of Operations Research, Vol 33, Iss 1, Pp 91-110 (2023)
Druh dokumentu:	article
ISSN:	0354-0243 1820-743X 21091501
DOI:	10.2298/YJOR210915015C
Popis:	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. Numerical experiments are reported, different instances with large sizes of the associated efficient sets are considered to show the efficiency of our algorithm compared with an approach proposed in the literature.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/0da9423f683a48a0907242d2d91baf84 Zobrazit plný text záznamu View record in DOAJ