期刊文献+

一类非线性比式和问题的对偶界方法 被引量:5

On Duality Bound Method for a Class of Nonlinear Sum of Ratios Problem
在线阅读 下载PDF
导出
摘要 针对一类非线性比式和问题首次提出一种求其全局最优解的单纯形分枝定界算法.该算法利用La-grange对偶理论将原来的非线性非凸优化问题转化为一系列易于求解的线性规划.理论分析和数值算例均表明提出的算法是可行的. This paper presents for the first time a simplicial branch and bound algorithm for globally solving a class of nonlinear sum of ratios problem. The algorithm uses Lagrange duality theory to convert the primal nonlinear nonconvex optimization problem into a sequence of linear programming problems,which can be solved very efficiently. Theory analysis and the numerical example show that the proposed algorithm is feasible.
出处 《河南师范大学学报(自然科学版)》 CAS CSCD 北大核心 2008年第3期131-133,共3页 Journal of Henan Normal University(Natural Science Edition)
基金 国家自然科学基金(10671057) 河南省高校科技创新人才计划 河南省教育厅自然科学基金
关键词 全局优化 比式和 分枝定界 对偶界 global optimization sum of ratios branch and bound duality bound
  • 相关文献

参考文献6

  • 1申培萍,焦红伟.一类非线性比式和问题的全局优化算法[J].河南师范大学学报(自然科学版),2006,34(3):5-8. 被引量:3
  • 2Benson H P. Using concave envelopes to globally solve the nonlinear sum of ratios problem[J]. Journal of Global Optimization,2002,22: 343-364.
  • 3Benson H P. Global optimization algorithm for the nonlinear sum of ratios problem[J]. Journal of Optimization Theory and Applications, 2002,112: 1-29.
  • 4Horst R,Pardalos P M,Thoai N V. Introduction to Global Optimization[M].Dordrecht: Kluwer, 1995.
  • 5Tuy H. Convex Analysis and Global Optimization[M]. Dordrecht: Kluwer,1998.
  • 6Tuy H. On a decomposition method for nonconvex global optimization[J]. Optimization Letters, 2007,1:245-258.

二级参考文献6

  • 1Benson 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.
  • 2Benson H P.Global optimization algorithm for the nonlinear sum of ratios problem[J].Journal of Optimization Theory and Applications,2002,112:1-29.
  • 3Benson H P.Using concave envelopes to globally solve the nonlinear sum of ratios problem[J].Journal of Global Optimization,2002,22:343-364.
  • 4Wang Y J,Zhang K C.Global optimization of nonlinear sum of ratios Problem[J].Applied Mathematics and Computation,2004,158:319-330.
  • 5Shen P P,Zhang K C.Global optimization of signomial geometric programming using linear relaxation[J].Applied Mathematics and Computation,2004,15:99-114.
  • 6Nataray P S V,Kotecha K.An algorithm for global optimization using the Taylor-Bernstein form as inclusion function[J].Journal of Global Optimization,2002,24:417-436.

共引文献2

同被引文献25

  • 1申培萍,焦红伟.一类非线性比式和问题的全局优化算法[J].河南师范大学学报(自然科学版),2006,34(3):5-8. 被引量:3
  • 2Horst R, Tuy H. Global Optimization: Deterministic Approaches[M]. 2nd Edition. Berlin=Springer Verlag, 1993.
  • 3申培萍.全局优化方法[M].北京:科学出版社,2007.
  • 4Wang Y J,Shen P P,Liang Z A.A branch-and-bound algorithm to globally solve the sum of several linear ratios[J].Applied Mathematics and Computation,2005,168:89-101.
  • 5Wang C F,Shen P P.A global optimization algorithm for linear fractional programming[J].Applied Mathematics and Computation,2008,204:281-287.
  • 6袁亚湘,孙文瑜.最优化理论与方法[M].上海:科学出版社,2003:241-384.
  • 7申培萍,汪春峰,段运鹏.半(E,F)-凸函数多目标规划的对偶性[J].河南师范大学学报(自然科学版),2007,35(3):206-208. 被引量:5
  • 8Cambinil R, Sodini C. Decomposition methods for solving nonconvex quadratic programs via branch and bound[J]. Journal of Global Opti-mization, 2005,33 : 313-336.
  • 9Rosen J B, Pardalos P M. Global minimization of large scale constrained concave quadratic problems by separable programming[J]. Math ematics Programming, 1986,34 : 163-174.
  • 10Raber U. A simplicial branch-and-bound method for solving noneonvex all quadratic programs[J]. Journal of Global Optimization, 1998, 13=417 432.

引证文献5

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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