Eusébio, AugustoJosé Rui FigueiraMatthias Ehrgott2025-04-042025-04-042009-10Eusé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-31619-4500http://hdl.handle.net/10400.8/12757MSC classification (2000) 90C29 · 90C35In 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.engMulti-criteria optimizationMulti-objective linear programmingNetwork flow problemPrimal–dual simplex algorithmjournal article10.1007/s10288-008-0087-31614-2411