摘要
讨论带一个反凸约束的凸规划问题－ 给出了整体最优解的特性，利用此特性借助分枝定界方法，构造出求该问题整体最优解的算法，并进行了收敛性分析－
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.
出处
《宁夏大学学报（自然科学版）》
CAS
1999年第4期302-304,共3页
Journal of Ningxia University(Natural Science Edition)
关键词
反凸规划
反凸约束
分枝定界方法
整体最优解
reverse convex programming
convex programming
reverse convex constraint
branch and bound algorithm
global optimization
