Thumbnail - Request a copy

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

Eusebio, Augusto; Figueira, José; Ehrgott, Matthias (2009), A primal–dual simplex algorithm for bi-objective network flow problems, 4OR, 7, 3, p. 255-273. http://dx.doi.org/10.1007/s10288-008-0087-3

Type
Article accepté pour publication ou publié
Date
2009
Journal name
4OR
Volume
7
Number
3
Publisher
Springer
Pages
255-273
Publication identifier
Metadata
Show full item record
Author(s)
Eusebio, Augusto
Figueira, José
Ehrgott, Matthias
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.
Subjects / Keywords
Multi-criteria optimization; Multi-objective linear programming; Network flow problem; Primal–dual simplex algorithm