Treffer: An algorithm for bi-objective integer linear programming problem
Title:
An algorithm for bi-objective integer linear programming problem
Authors:
Source:
Filomat. 36:5641-5651
Publisher Information:
National Library of Serbia, 2022.
Publication Year:
2022
Document Type:
Fachzeitschrift
Article
Language:
English
ISSN:
2406-0933
0354-5180
0354-5180
DOI:
10.2298/fil2216641p
Rights:
CC 0
Accession Number:
edsair.doi...........b042f2663ded5d58ce1ebd7eb1b58b19
Database:
OpenAIRE
Weitere Informationen
In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work is to effectively implement the ?-constraint method to produce a complete set of non dominated points. The convergence of the algorithm has been established theoretically. Further a comparative study to some existing algorithm has also been made.