Maximizing a Linear Fractional Function on a Pareto Efficient Frontier

We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included.

[1]  On the relationships between bicriteria problems and non-linear programming , 1994 .

[2]  Hector A. Rosales-Macedo.  Nonlinear Programming: Theory and Algorithms (2nd Edition) , 1993 .

[3]  Paul Armand,et al.  Finding all maximal efficient faces in multiobjective linear programming , 1993, Math. Program..

[4]  Samuel Karlin,et al.  Mathematical Methods and Theory in Games, Programming, and Economics , 1961 .

[5]  Hiroshi Konno,et al.  Generalized linear multiplicative and fractional programming , 1991 .

[6]  Serpil Sayin,et al.  Optimizing Over the Efficient Set Using a Top-Down Search of Faces , 2000, Oper. Res..

[7]  A. Cambini,et al.  On Maximizing a Sum of Ratios , 1989 .

[8]  Y. D. Hu,et al.  Connectedness of the efficient set in strictly quasiconcave vector maximization , 1993 .

[9]  E. J. Sun.  On the connectedness of the efficient set for strictly quasiconvex vector minimization problems , 1996 .

[10]  A. Charnes,et al.  Data Envelopment Analysis Theory, Methodology and Applications , 1995 .

[11]  Ury Passy,et al.  Explicit representation of the two-dimensional section of a production possibility set , 1994 .

[12]  A. Cambini,et al.  Linear Fractional and Bicriteria Linear Fractional Programs , 1990 .

[13]  J. Benoist.  Connectedness of the Efficient Set for Strictly Quasiconcave Sets , 1998 .

[14]  S. Schaible,et al.  Connectedness of the Efficient Set for Three-Objective Quasiconcave Maximization Problems , 1997 .

[15]  S. Bolintineanu,et al.  Minimization of a quasi-concave function over an efficient set , 1993, Math. Program..

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

[17]  Bruce W. Lamar,et al.  An improved branch and bound algorithm for minimum concave cost network flow problems , 1989, J. Glob. Optim..

[18]  János Fülöp,et al.  Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem , 2000 .

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

[20]  A. R. Warburton,et al.  Parametric Solution of Bicriterion Linear Fractional Programs , 1985, Oper. Res..

[21]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[22]  Tomomi Matsui,et al.  Parametric simplex algorithms for solving a special class of nonconvex minimization problems , 1991, J. Glob. Optim..

[23]  Joseph C. Paradi,et al.  Marginal Rates and Two-dimensional Level Curves in DEA , 1998 .

[24]  A. Cambini,et al.  A survey of bicriteria fractional problems , 1999 .

[25]  Susan W. Palocsay,et al.  Image space analysis of generalized fractional programs , 1994, J. Glob. Optim..

[26]  Harold O. Fried,et al.  The measurement of productive efficiency : techniques and applications , 1993 .

[27]  Hiroshi Konno,et al.  Minimizing and maximizing the product of linear fractional functions , 1992 .

[28]  Harold P. Benson,et al.  An all-linear programming relaxation algorithm for optimizing over the efficient set , 1991, J. Glob. Optim..

[29]  Jerald P. Dauer,et al.  Optimization over the efficient set , 1995, J. Glob. Optim..

[30]  Harold P. Benson,et al.  Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem , 1996 .

[31]  Reiner Horst,et al.  Utility Function Programs and Optimization over the Efficient Set in Multiple-Objective Decision Making , 1997, Universität Trier, Mathematik/Informatik, Forschungsbericht.

[32]  Abraham Charnes,et al.  Measuring the efficiency of decision making units , 1978 .

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

[34]  Harold P. Benson,et al.  An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem , 1998, J. Glob. Optim..