期刊文献+

一类非线性比式和问题的分支定界算法 被引量:1

A branch and bound algorithm for a class of nonlinear sum of ratios problem
在线阅读 下载PDF
导出
摘要 首先将问题(P)转化为其等价问题(Q),然后利用线性化技术,给出(Q)目标函数及约束函数的线性下界函数,建立了(Q)松弛线性规划问题(RLP),通过求解其子域上一系列线性规划问题,不断更新(Q)的上下界,理论上证明了算法的收敛性,数值实验表明了算法的可行性. The problem (P) is converted into an equivalent problem (Q). Then linear lower bound functions for the objective function and constraint functions of (Q) is presented utilizing the linerizing technology. A relaxation liner programming problem (RLP) about (Q) is established by solving a series of linear programming problems on the sub-region, and upper and lower bounds constantly are updated. The proposed algorithm is theoretically proved to be convergent. The numerical experiments show the feasibility of the algorithm.
出处 《暨南大学学报(自然科学与医学版)》 CAS CSCD 北大核心 2012年第1期38-42,共5页 Journal of Jinan University(Natural Science & Medicine Edition)
基金 国家自然科学基金项目(11171094 11171368)
关键词 分支定界 线性松弛 全局优化 非线性比式和 branch and bound liner ralaxation global optimization nonlinear sum of ratios
  • 相关文献

参考文献9

  • 1KONNO H,INORI M.Bond portfolio optimization by bi-linear fractional programming[J].Journal of the Opera-tions Research Society of Japan,1989,32:143-158.
  • 2MAJHI J,JANARDAN R,SMID M,et al.On some geo-metric optimization problems in layered manufacturing[J].Computational Geometry,1999,12:219-239.
  • 3QU S J,ZHANG K C,JI Y.A global optimization algo-rithm using parametric linearization relaxation[J].Ap-plied Mathematics and Computation,2007,186:763-771.
  • 4SHEN P P,LI X A,JIAO H W.Accelerating method ofglobal optimization for signomial geometric programming[J].Journal of Computational and Applied Mathematics,2008,214:66-77.
  • 5FREUND R W,JARRE F.Sloving the sum-of-ratiosproblem by an interior-point method[J].Journal ofGlobal Ptimization,2001,19:83-102.
  • 6BENSON H P.A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem.[J].European Journal of Operational Research,2007,182:597-611.
  • 7李晓爱,顾敏娜,申培萍.带非凸二次约束的二次比式和问题的全局优化算法(英文)[J].应用数学,2010(2):438-444. 被引量:6
  • 8李晓爱,刘金伟,申培萍.二次比式和问题的加速分枝定界算法[J].应用数学学报,2011,34(4):712-722. 被引量:2
  • 9WANG Y J,ZHANG K C.Global optimization of nonlin-ear sum of ratios problem[J].Applied Mathematics andComputation1,2004,158:319-330.

二级参考文献10

  • 1Sui Y K. The expansion of functions under transformation and its application to optimization, Comput [J]. Methods Appl. Mech. Engrg, 1994,113:253-262.
  • 2Benson H P. On the global optimization of sums of linear fractional functions over a convex Set[J]. Journal of Optimization Theory and Applications,2004,121:19-39.
  • 3Kuno T. A revision of trapexziodal branch and bound algorithm for linear sum of rations problems[J]. Journal of Global Optimization, 2005,33 : 215-234.
  • 4Qu S J, Zhang K C. A global optimization algorithm using parametric linearization relaxation[J]. Applied Mathematics and Computation, 2007,186:763-771.
  • 5Qu S J,Zhang K C. An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadrtic constraints[J]. Applied Mathematics and Computation, 2007,189: 1624-1636.
  • 6Freund R W,Jarre F. Sloving the sum-of-ratios problem by an interior-point method[J]. Journal of Global Optimization, 2001,19 : 83-102.
  • 7Shen P P, Duan Y P. A simplicial branch and duality bound algorithm for the sum of convex-convex ratios proplem[J]. Journal of Computational and Applied Mathematics,2009,223:145-158.
  • 8An L T H. Tao P T. A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems[J]. Journal of Global Optimization, 1998, 13: 171-206.
  • 9Shen P P, Li X I,Jiao H W. Accelerating method of Global optimization for signomial geometric programming[J]. Journal of Computational and Applied Mathematics,2008,214: 66-77.
  • 10李晓爱,顾敏娜,申培萍.带非凸二次约束的二次比式和问题的全局优化算法(英文)[J].应用数学,2010(2):438-444. 被引量:6

共引文献6

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部