Solving Sum of Ratios Fractional Programs via Concave Minimization

Abstract This article presents an algorithm for globally solving a sum of ratios fractional programming problem. To solve this problem, the algorithm globally solves an equivalent concave minimization problem via a branch-and-bound search. The main work of the algorithm involves solving a sequence of convex programming problems that differ only in their objective function coefficients. Therefore, to solve efficiently these convex programming problems, an optimal solution to one problem can potentially be used to good advantage as a starting solution to the next problem.

[1]  W. R. Buckland,et al.  Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. , 1952 .

[2]  M. Rao.  Cluster Analysis and Mathematical Programming , 1971 .

[3]  S. Schaible.  A note on the sum of a linear and linear‐fractional function , 1977 .

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

[5]  Hiroshi Konno,et al.  BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING , 1989 .

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

[7]  R. Horst,et al.  Global Optimization: Deterministic Approaches , 1992 .

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

[9]  Hiroshi Konno,et al.  Global minimization of a generalized convex multiplicative function , 1994, J. Glob. Optim..

[10]  P. Pardalos,et al.  Handbook of global optimization , 1995 .

[11]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[12]  Harold P. Benson,et al.  Concave Minimization: Theory, Applications and Algorithms , 1995 .

[13]  H. P. Benson.  Deterministic algorithms for constrained concave minimization: A unified critical survey , 1996 .

[14]  H. Konno,et al.  BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING: A PARTIAL OPTIMIZATION APPROACH , 1996 .

[15]  H. Konno,et al.  Minimizing sums and products of linear fractional functions over a polytope , 1999 .

[16]  Hiroshi Konno,et al.  A Branch and Bound Algorithm for Solving Low Rank Linear Multiplicative and Fractional Programming Problems , 2000, J. Glob. Optim..

[17]  Roland W. Freund,et al.  Solving the Sum-of-Ratios Problem by an Interior-Point Method , 2001, J. Glob. Optim..

[18]  Harold P. Benson,et al.  Global Optimization of Nonlinear Sums of Ratios , 2001 .

[19]  R. Horst,et al.  Solving sum-of-ratios fractional programs using efficient points , 2001 .

[20]  Takahito Kuno,et al.  A branch-and-bound algorithm for maximizing the sum of several linear ratios , 2002, J. Glob. Optim..

[21]  HAROLD P. BENSON.  Using concave envelopes to globally solve the nonlinear sum of ratios problem , 2002, J. Glob. Optim..

[22]  H. P. Benson,et al.  On the Global Optimization of Sums of Linear Fractional Functions over a Convex Set , 2004 .