首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类线性比式和问题的鲁棒算法
引用本文:程维新,柳俊峰.一类线性比式和问题的鲁棒算法[J].河南师范大学学报(自然科学版),2009,37(3).
作者姓名:程维新  柳俊峰
作者单位:1. 河南师范大学,数学与信息科学学院,河南,新乡,453007
2. 陕西理工学院,数学系,陕西,汉中,723000
基金项目:国家自然科学基金,河南省高校科技创新人才支持计划项目 
摘    要:对广泛应用于工程设计、非线性系统稳定性分析等实际问题中的一类线性比式和问题(P1)提出了一种鲁棒全局优化算法,这种方法求得的最优解具有稳定性好,可行等特点.从理论上证明了该算法的收敛性,最终数值实验表明了提出方法的可行性.

关 键 词:全局优化  线性比式和  分枝定界  鲁棒解

A Robust Algorithm for a Class of linear Sum of Ratios Problem
CHENG Wei-xin,LIU Jun-feng.A Robust Algorithm for a Class of linear Sum of Ratios Problem[J].Journal of Henan Normal University(Natural Science),2009,37(3).
Authors:CHENG Wei-xin  LIU Jun-feng
Institution:1.College of Mathematics and Information Science;Henan Normal University;Xinxiang 453007;China;2.Department of Mathematics;Shaanxi University of Technology;Hanzhong 723000;China
Abstract:A robust algorithm is proposed for a class of linear sum of ratios problem(P1),which can be applied to engineering designs and stability analysis of nonlinear systems and so on pratical problems.The proposed algorithm provides a global optimal solution which is also stable under small perturbations of the constraints,and is adequately guaranteed to be feasible.From theory the proof which the proposed branch and bound algorithm is convergent to the global minimum is given.And finally the numerical experiment...
Keywords:global optimization  linear sum of ratios  branch and bound  robust solution  
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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