In this paper, we discuss a general model for multiple criteria linear cost network flow problems. This model includes several classes of existing models in the operations research literature as special cases. Based on this model, a search algorithm for finding a feasible solution of the concurrent flow problem is suggested and illustrative numerical examples are given. This search algorithm is also extended to obtain a new algorithm for finding the efficient frontier of a multiple criteria linear program.
|Number of pages||14|
|Journal||Journal of the Australian Mathematical Society Series B-Applied Mathematics|
|Publication status||Published - 1 Apr 1999|
ASJC Scopus subject areas
- Applied Mathematics