Geodesic
An algorithm for bi-objective integer linear programming problem
Filomat, Tome 36 (2022) no. 16, p. 5641

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

DOI

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.
DOI : 10.2298/FIL2216641P
Classification : 90C10, 90C29 , 90C05
Keywords: Integer programming problem, Multi-objective programming problem, Linear programming 
Prerna ; Vikas Sharma. An algorithm for bi-objective integer linear programming problem. Filomat, Tome 36 (2022) no. 16, p. 5641 . doi: 10.2298/FIL2216641P
@article{10_2298_FIL2216641P,
     author = {Prerna  and Vikas Sharma},
     title = {An algorithm for bi-objective integer linear programming problem},
     journal = {Filomat},
     pages = {5641 },
     year = {2022},
     volume = {36},
     number = {16},
     doi = {10.2298/FIL2216641P},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL2216641P/}
}
TY  - JOUR
AU  - Prerna 
AU  - Vikas Sharma
TI  - An algorithm for bi-objective integer linear programming problem
JO  - Filomat
PY  - 2022
SP  - 5641 
VL  - 36
IS  - 16
UR  - http://geodesic.mathdoc.fr/articles/10.2298/FIL2216641P/
DO  - 10.2298/FIL2216641P
LA  - en
ID  - 10_2298_FIL2216641P
ER  - 
%0 Journal Article
%A Prerna 
%A Vikas Sharma
%T An algorithm for bi-objective integer linear programming problem
%J Filomat
%D 2022
%P 5641 
%V 36
%N 16
%U http://geodesic.mathdoc.fr/articles/10.2298/FIL2216641P/
%R 10.2298/FIL2216641P
%G en
%F 10_2298_FIL2216641P

Cité par Sources :