Global Optimization for a Class of Nonlinear Sum of Ratios Problem

We present a branch and bound algorithm for globally solving the sum of ratios problem. In this problem, each term in the objective function is a ratio of two functions which are the sums of the absolute values of affine functions with coefficients. This problem has an important application in financial optimization, but the global optimization algorithm for this problem is still rare in the literature so far. In the algorithm we presented, the branch and bound search undertaken by the algorithm uses rectangular partitioning and takes place in a space which typically has a much smaller dimension than the space to which the decision variables of this problem belong. Convergence of the algorithm is shown. At last, some numerical examples are given to vindicate our conclusions.

[1]  Detong Zhu,et al.  Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region , 2013 .

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

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

[4]  I. Stancu-Minasian.  Fractional Programming in The Complex Space , 1997 .

[5]  Harold P. Benson,et al.  A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem , 2007, Eur. J. Oper. Res..

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

[7]  H. Konno,et al.  An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs , 2007 .

[8]  Peiping Shen,et al.  Using conical partition to globally maximizing the nonlinear sum of ratios , 2010 .

[9]  P. T. Thach,et al.  Optimization on Low Rank Nonconvex Structures , 1996 .

[10]  G. Nemhauser,et al.  Integer Programming , 2020 .

[11]  TAKAHITO KUNO,et al.  A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems , 2005, J. Glob. Optim..

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

[13]  Peiping Shen,et al.  A note on the paper global optimization of nonlinear sum of ratios , 2007, Appl. Math. Comput..

[14]  A. Lo,et al.  MAXIMIZING PREDICTABILITY IN THE STOCK AND BOND MARKETS , 1995, Macroeconomic Dynamics.

[15]  Chun-Feng Wang,et al.  Global optimization for sum of linear ratios problem with coefficients , 2006, Appl. Math. Comput..

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

[17]  Shouyang Wang,et al.  Conical Partition Algorithm for Maximizing the Sum of dc Ratios , 2005, J. Glob. Optim..

[18]  Michiel H. M. Smid,et al.  On Some Geometric Optimization Problems in Layered Manufacturing , 1997, WADS.

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

[20]  Harold P. Benson.  Branch-and-Bound Outer Approximation Algorithm for Sum-of-Ratios Fractional Programs , 2010 .

[21]  W. Andrew,et al.  LO, and A. , 1988 .

[22]  H. P. Benson,et al.  Global Optimization Algorithm for the Nonlinear Sum of Ratios Problem , 2002 .