论文信息 - A compromise procedure for the multiple objective linear fractional programming problem

A compromise procedure for the multiple objective linear fractional programming problem

Abstract A generalization of a well-known multiple objective linear fractional programming (MOLFP) problem, the multiple objective fractional programming (MOFP) problem, is formulated. A concept of multiple objective programming (MOP) problem corresponding to MOFP is introduced and some relations between those problems are examined. Based on these results, a compromise procedure for MOLFP problem is proposed. A numerical example is given to show how the procedure works.

Ireneusz Nykowski | Zbigniew Zołkiewski | Z. Żółkiewski | Ireneusz Nykowski

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

[2] Ralph E. Steuer,et al. A revised simplex method for linear multiple objective programs , 1973, Math. Program..

[3] Ralph E. Steuer,et al. Goal programming with linear fractional criteria , 1981 .

[4] Mathilde Benveniste,et al. Testing for complete efficiency in a vector maximization problem , 1977, Math. Program..

[5] Ralph E. Steuer,et al. Multiple Objective Linear Fractional Programming , 1981 .

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

[8] E. Choo,et al. Bicriteria linear fractional programming , 1982 .

[9] Heinz Isermann,et al. The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program , 1977 .