A primal–dual simplex algorithm for bi-objective network flow problems

Thumbnail
Date
2009
Dewey
Recherche opérationnelle
Sujet
Multi-criteria optimization; Multi-objective linear programming; Network flow problem; Primal–dual simplex algorithm
Journal issue
4OR
Volume
7
Number
3
Publication date
2009
Article pages
255-273
Publisher
Springer
DOI
http://dx.doi.org/10.1007/s10288-008-0087-3
URI
https://basepub.dauphine.fr/handle/123456789/12661
Collections
Metadata
Show full item record
Author
Eusebio, Augusto
Figueira, José
Ehrgott, Matthias
Type
Article accepté pour publication ou publié
Abstract (EN)
In this paper we develop a primal–dual simplex algorithm for the bi-objective linear minimum cost network flow problem. This algorithm improves the general primal–dual simplex algorithm for multi-objective linear programs by Ehrgott et al. (J Optim Theory Appl 134:483–497, 2007). We illustrate the algorithm with an example and provide numerical results.