华侨大学学报（自然科学版）Issue(3)：340-343,4.DOI:10.11830/ISSN.1000-5013.2014.03.0340
一类非线性比式和问题的分支定界算法
Branch and Bound Algorithm for a Class of Nonlinear Sum of Ratios Problem
摘要
Abstract
For a class nonlinear sum of ratios global optimization problem (P),the branch and bound algorithm is given. First of all,problem (P)will be transformed into problem (Q),so that the number of variables and the number of con-strains of the two problems are equal.After that,by using the inequality sacling method,the relaxed linear programming about problem (Q)is established and combined with the branch and bound algorithm for solving. Last,based on these steps,region-deleting rules are put forward and numerical experiments are carried out.The result shows that the algo-rithm and the region-deleting rules are feasible.关键词
松弛线性规划/分支定界算法/区域删减策略/非线性比式和/全局优化Key words
relaxed linear programming/branch and bound/region-deleting rules/nonlinear sum of ratios/global opti-mization分类
数理科学引用本文复制引用
杨金勇,宋海洲..一类非线性比式和问题的分支定界算法[J].华侨大学学报（自然科学版）,2014,(3):340-343,4.基金项目
华侨大学科研基金资助项目 （）
