论文信息 - Bicriteria network flow problems: Continuous case

Bicriteria network flow problems: Continuous case

Abstract An algorithm for bicriteria network flow problems is developed. It deals with a broader class of minimum cost network flow problems which include transportation, maximum flow, assignment, shortest path, and transshipment problems rather than a specific one. The algorithm integrates bicriteria mathematical programming theory with the out-of-kilter method.

P. Simin Pulat | P. S. Pulat | Haijune Lee | Haijune Lee | P. Pulat

[1] P. Yu,et al. The set of all nondominated solutions in linear cases and a multicriteria simplex method , 1975 .

[2] Ralph E. Steuer. Multiple Objective Linear Programming with Interval Criterion Weights , 1976 .

[3] J. Ecker,et al. Generating all maximal efficient faces for multiple objective linear programs , 1980 .

[4] R. Rosenthal. Concepts, Theory, and Techniques PRINCIPLES OF MULTIOBJECTIVE OPTIMIZATION* , 1985 .

[5] T. L. Saaty,et al. The computational algorithm for the parametric objective function , 1955 .

[6] Y. Aneja,et al. BICRITERIA TRANSPORTATION PROBLEM , 1979 .

[7] S. Zionts,et al. An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions , 1983 .

[8] Don T. Phillips,et al. Fundamentals Of Network Analysis , 1981 .

[9] T. Gal. A general method for determining the set of all efficient solutions to a linear vectormaximum problem , 1977 .

[10] Joseph G. Ecker,et al. Finding all efficient extreme points for multiple objective linear programs , 1978, Math. Program..

[11] Joseph G. Ecker,et al. Finding efficient points for linear multiple objective programs , 1975, Math. Program..

[12] Arthur M. Geoffrion,et al. Solving Bicriterion Mathematical Programs , 1967, Oper. Res..

[13] Thomas L. Magnanti,et al. Deterministic network optimization: A bibliography , 1977, Networks.

[14] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .