scientific article; zbMATH DE number 1217674
Recently \textit{G. Ruhe} [`Algorithmic aspects of flows in networks' (1991; Zbl 0746.90021)] developed another simplex method for solving a multiple criteria linear cost network flow problem. The aim of this paper is to consider a more general multiple criteria linear cost network flow model which includes the problem addressed by Ruhe as a special case. In addition, this model also includes two other important network flow problems as special cases, these are: (i) finding a feasible solution for the single criterion multiple commodity flow problems; (ii) solving the subproblem in a resource directive-decomposition method for multiple criteria multiple commodity flow problems. This general model will be formulated in Section 2, with the reduction of the general model to the special cases discussed in Section 3. A search algorithm for finding a feasible solution to the multiple commodity flow problem based on the multiple criteria model is presented in Section 4 with full justification. For the entire collection see [Zbl 0897.00034].
- The gap function of a convex multicriteria optimization problem
- A linear model for compound multicommodity network flow problems
- Using mathematical programming heuristics in a multicriteria network flow context
- Models and algorithms for multiple criteria linear cost network programs
- Modeling and Analysis of Multicommodity Network Flows Via Goal Programming
- Multiple objective minimum cost flow problems: a review
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4215031)