Home > Research > Publications & Outputs > A primal–dual simplex algorithm for bi-objectiv...

Research

Links

Text available via DOI:

View graph of relations

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

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published
Close
More...
<mark>Journal publication date</mark>1/10/2009
<mark>Journal</mark>4OR: A Quarterly Journal of Operations Research
Issue number3
Volume7
Number of pages19
Pages (from-to)255-273
Publication StatusPublished
<mark>Original language</mark>English

Abstract

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.