首页 | 官方网站   微博 | 高级检索  
     

带系数线性比式和问题的全局优化方法(英文)
引用本文:尹景本,陈永强.带系数线性比式和问题的全局优化方法(英文)[J].河南科学,2008,26(4):392-395.
作者姓名:尹景本  陈永强
作者单位:1. 河南科技学院,数学系,河南,新乡,453003
2. 河南师范大学河南科技学院,数学系,河南,新乡,453003
基金项目:国家自然科学基金 , 河南科技学院自然科学基金
摘    要:对带系数的线性比式和问题(P)提出一确定性全局优化算法.利用等价问题和线性化技术给出了问题(P)的松弛线性规划(RLP),通过对(RLP)可行域的细分以及一系列(RLP)的求解过程,提出的分枝定界算法收敛问题(P)全局最优解.最终数值实验表明了提出方法的可行性.

关 键 词:线性比式和  全局优化  线性化技术  分枝定界
文章编号:1004-3918(2008)04-0392-04
修稿时间:2007年8月8日

Global Optimization for Sum of Linear Ratios Problems with Coefficients
Yin Jingben,Chen Yongqiang.Global Optimization for Sum of Linear Ratios Problems with Coefficients[J].Henan Science,2008,26(4):392-395.
Authors:Yin Jingben  Chen Yongqiang
Affiliation:Yin Jingben1,Chen Yongqiang2 (1.Department of Mathematics,Henan Institute of Science , Technology,Xinxiang 453003,Henan China,2.College of Mathematics , Information Science,Henan Normal University,Xinxiang 453007,Henan China)
Abstract:In this paper a global optimization algorithm is proposed for locating global minimum of sum of linear ratios problem (P) with coefficients.By utilizing equivalent problem and linearization technique,the relaxation linear programming (RLP) about the (P) is established,thus the initial non-convex problem (P) is reducedto a series of linear programming (RLP).The proposed branch and bound algorithm is convergent to the global minimum of (P) through the successive refinement of the feasible region and solutions of a series of RLP.And finally the numerical experiment is given to illustrate the feasibility of the presented algorithm.
Keywords:sum of linear ratios  global optimization  linearization technique  branch-and-bound
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号