Global optimization for sum of generalized fractional functions

This paper considers the solution of generalized fractional programming (GFP) problem which contains various variants such as a sum or product of a finite number of ratios of linear functions, polynomial fractional programming, generalized geometric programming, etc. over a polytope. For such problems, we present an efficient unified method. In this method, by utilizing a transformation and a two-part linearization method, a sequence of linear programming relaxations of the initial nonconvex programming problem are derived which are embedded in a branch-and-bound algorithm. Numerical results are given to show the feasibility and effectiveness of the proposed algorithm.

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

[2]  Jean B. Lasserre,et al.  Semidefinite Programming vs. LP Relaxations for Polynomial Programming , 2002, Math. Oper. Res..

[3]  H. Tuy.  Convex analysis and global optimization , 1998 .

[4]  Hanif D. Sherali,et al.  Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents , 1998, J. Glob. Optim..

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

[6]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[7]  Hoang Tuy,et al.  A Unified Monotonic Approach to Generalized Linear Fractional Programming , 2003, J. Glob. Optim..

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

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

[10]  Hanif D. Sherali,et al.  New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems , 1997, Oper. Res. Lett..

[11]  Hiroshi Konno,et al.  Minimization of the sum of three linear fractional functions , 1999, J. Glob. Optim..

[12]  N. Shor.  Nondifferentiable Optimization and Polynomial Problems , 1998 .

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

[14]  Susan W. Palocsay,et al.  Optimizing the sum of linear fractional functions , 1992 .

[15]  Peiping Shen,et al.  Global optimization of signomial geometric programming using linear relaxation , 2004, Appl. Math. Comput..

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

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