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

Eusébio, Augusto; José Rui Figueira; Matthias Ehrgott

http://hdl.handle.net/10400.8/12757

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
A primal-dual simplex algorithm for bi-objective network flow problems.pdf	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.	381.91 KB	Adobe PDF	Download

Send Feedback

Authors

Eusébio, Augusto

José Rui Figueira

Matthias Ehrgott

Abstract(s)

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.

Description

MSC classification (2000) 90C29 · 90C35

Keywords

Multi-criteria optimization Multi-objective linear programming Network flow problem Primal–dual simplex algorithm

URI

http://hdl.handle.net/10400.8/12757

Citation

Eusébio, A., Figueira, J.R. & Ehrgott, M. A primal–dual simplex algorithm for bi-objective network flow problems. 4OR-Q J Oper Res 7, 255–273 (2009). https://doi.org/10.1007/s10288-008-0087-3