论文信息 - Multiple Objective Linear Fractional Programming

Multiple Objective Linear Fractional Programming

This paper presents a simplex-based solution procedure for the multiple objective linear fractional programming problem. By 1 departing slightly from the traditional notion of efficiency and 2 augmenting the feasible region as in goal programming, the solution procedure solves for all weakly efficient vertices of the augmented feasible region. The article discusses the difficulties that must be addressed in multiple objective linear fractional programming and motivates the solution algorithm that is developed.

Ralph E. Steuer | J. Kornbluth

[1] E. Beale. ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .

[2] Abraham Charnes,et al. Programming with linear fractional functionals , 1962 .

[3] A. Williams. Marginal Values in Linear Programming , 1963 .

[4] M. E. Thomas,et al. Fractional Programming: A Survey. , 1971 .

[5] Sang M. Lee,et al. Goal programming for decision analysis , 1972 .

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

[7] Gabriel R. Bitran,et al. Linear Programming with a Fractional Objective Function , 1973, Oper. Res..

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

[9] Ştefan Ţigan. Sur le problème de la programmation vectorielle fractionnaire , 1975 .

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

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

[12] Eng-Ung Choo,et al. Multicriteria linear fractional programming , 1981 .