1. Global optimization algorithm for sum of generalized polynomial ratios problem
- Author
-
Jiao, Hongwei, Wang, Zhankui, and Chen, Yongqiang
- Subjects
- *
GLOBAL analysis (Mathematics) , *MATHEMATICAL optimization , *POLYNOMIALS , *LINEAR programming , *ALGORITHMS , *MATHEMATICAL transformations , *EXPONENTS , *NONCONVEX programming - Abstract
Abstract: In this paper, a global optimization algorithm is proposed for solving sum of generalized polynomial ratios problem (P) which arises in various practical problems. Due to its intrinsic difficulty, less work has been devoted to globally solve the problem (P). For such problems, we present a branch and bound algorithm. In this method, by utilizing exponent transformation and new three-level linear relaxation method, a sequence of linear relaxation programming of the initial nonconvex programming problem (P) are derived which are embedded in a branch and bound algorithm. The proposed method need not introduce new variables and constraints and it is convergent to the global minimum of prime problem by means of the subsequent solutions of a series of linear programming problems. Several numerical examples in the literatures are tested to demonstrate that the proposed algorithm can systematically solve these examples to find the approximate ϵ-global optimum. [Copyright &y& Elsevier]
- Published
- 2013
- Full Text
- View/download PDF