| 全局求解符号线性比式和问题 |
| |
| 引用本文： | 陈永强,张曙光.全局求解符号线性比式和问题[J].河南师范大学学报(自然科学版),2011,39(2):20-23. |
| |
| 作者姓名： | 陈永强 张曙光 |
| |
| 作者单位： | 1. 河南师范大学数学与信息科学学院,河南新乡,453007
2. 焦作师范高等专科学校数学系,河南焦作,454000 |
| |
| 基金项目： | 国家自然科学基金(10671057);河南省高校科技创新人才支持计划项目(2008HASTIT023) |
| |
| 摘 要： | 对符号线性比式和问题(P1)提出了一种分枝定界全局优化算法,这种方法能求得原问题的非孤立最优解,从理论上证明了该算法的有限收敛性.最后数值实验表明了提出方法的可行性.
|
| 关 键 词： | 全局优化 符号线性比式和 分枝定界 |
Solving Globally the Signomial Sum of Linear Ratios Problems |
| |
| CHEN Yong-qiang,ZHANG Shu-guang.Solving Globally the Signomial Sum of Linear Ratios Problems[J].Journal of Henan Normal University(Natural Science),2011,39(2):20-23. |
| |
| Authors: | CHEN Yong-qiang ZHANG Shu-guang |
| |
| Institution: | 1.College of Mathematics and Information Sciences,Henan Normal University,Xinxiang 453007,China;2.Department of Mathematics,Jiaozuo Teacher’s College,Jiaozuo 454000,China) |
| |
| Abstract: | In this paper a branch and bound algorithm is proposed for signomial sum of linear ratios problems(P1).From theory the proof which the proposed branch and bound algorithm is convergent to the global minimum is given.And finally the numerical experiments are given to illustrate the feasibility of the proposed algorithm. |
| |
| Keywords: | global optimization signomial sum of linear ratios branch and bound |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
