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

带一个反凸约束的凸规划问题
引用本文:高岳林.带一个反凸约束的凸规划问题[J].宁夏大学学报(自然科学版),1999,20(4):302-304.
作者姓名:高岳林
作者单位:西北第二民族学院信息与计算科学系!宁夏银川750021
摘    要:讨论带一个反凸约束的凸规划问题- 给出了整体最优解的特性,利用此特性借助分枝定界方法,构造出求该问题整体最优解的算法,并进行了收敛性分析-

关 键 词:反凸规划  凸规划  反凸约束  分枝定界方法  整体最优化
文章编号:0253-2328(1999)04-0309-03
修稿时间:1999-03-08

Convex programs with an additional reverse convex constraint
Li Foqi.Convex programs with an additional reverse convex constraint[J].Journal of Ningxia University(Natural Science Edition),1999,20(4):302-304.
Authors:Li Foqi
Institution:Li Foqi Department of Mathematics,Jiaying University,Meizhou 514015,China
Abstract:The paper discusses convex programs with an additional reverse convex constraint and gives the properties of the global optimization about this problem.A branch and bound algorithm for solving this problem is constructed and the convergence properties of this algorithm is analysed.
Keywords:reverse convex programming  convex programming  reverse convex constraint  branch  and  bound algorithm  global optimization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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