Global optimization for the generalized polynomial sum of ratios problem

  • Authors:

  • Peiping Shen;Yuan Ma;Yongqiang Chen

  • Affiliations:

  • College of Mathematics and Information Science, Henan Normal University, Xinxiang, People's Republic of China 453007;College of Mathematics and Information Science, Henan Normal University, Xinxiang, People's Republic of China 453007;College of Mathematics and Information Science, Henan Normal University, Xinxiang, People's Republic of China 453007

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, a new deterministic global optimization algorithm is proposed for solving a fractional programming problem whose objective and constraint functions are all defined as the sum of generalized polynomial ratios, which arises in various practical problems. Due to its intrinsic difficulty, less work has been devoted to globally solving this problem. The proposed algorithm is based on reformulating the problem as a monotonic optimization problem, and it turns out that the optimal solution which is provided by the algorithm is adequately guaranteed to be feasible and to be close to the actual optimal solution. Convergence of the algorithm is shown and numerical examples are given to illustrate the feasibility and efficiency of the present algorithm.