Solution Approaches for Network Flow Problems with Multiple Criteria,
Abstract
A network variant of the multicriteria linear programming problem is presented. The primal simplex multicriteria algorithm first developed by Yu and Zeleny is specialized to handle the simple basis structure of the multicriteria uncapacitated transshipment problem. Specifically, the basis tree representation and updating techniques that have proven to be successful for single criterion network flow problems are used to substantially reduce the computational effort required for the multicriteria simplex algorithm. The fundamental theoretical results for the general multicriteria linear programming problem are presented followed by a brief review of the relevant aspects of the network basis structure. Next, the specialized multicriteria primal simplex algorithm for the uncapacitated transshipment problem is presented and a small example problem is given. Then a network variant of the surrogate criterion linear programming approach is presented. For sake of illustration, the shortest path problem is used as the class of networks to be solved. However this approach can be easily extended to any of the other classes of network flow problems. In this section an interactive solution procedure is described that involves both the decision maker and the computer at each stage.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1979
- Accession Number
- ADA084283
Entities
People
- Darwin Dee Klingman
- John Mote
Organizations
- University of Texas at Austin