摘要
在这份报纸，一个全球优化算法被全球性解决等价于问题(P)的问题( P1 )为比率问题(P) .The 算法工作的非线性的和建议，由利用 linearization 技术线性松驰编程( P1 )当时是建议的 obtained.The 算法对全球最小会聚( P1 )通过目的可行区域的线性松驰的连续精炼工作并且一系列线性松驰 programming.Numerical
In this paper, a global optimization algorithm is proposed for nonlinear sum of ratios problem （P）. The algorithm works by globally solving problem （P1） that is equivalent to problem （P）, by utilizing linearization technique a linear relaxation programming of the （P1） is then obtained. The proposed algorithm is convergent to the global minimum of （P1） through the successive refinement of linear relaxation of the feasible region of objective function and solutions of a series of linear relaxation programming. Numerical results indicate that the proposed algorithm is feasible and can be used to globally solve nonlinear sum of ratios problems （P）.
基金
Foundation item： Supported by the National Natural Science Foundation of China（10671057）
Supported by the Natural Science Foundation of Henan Institute of Science and Technology（06054）
