Lexicographic optimisation in generalised network flow problems

In this paper the lexicographic optimisation of the multiobjective generalised network flow problem is considered. Optimality conditions are proved on the basis of the equivalence of this problem and a weighted generalised network flow problem. These conditions are used to develop a network-based algorithm which properly modifies primal–dual algorithms for minimum cost generalised network flow problems. Computational results indicate that this algorithm is faster than general-purpose algorithms for linear lexicographic optimisation. Besides, this model is used for approaching a water resource system design problem.