有界凸域上非凸二次整体规划问题的单纯形剖分算法  

A Simplex Partition Algorithm for Nonconvex Global Quadratic Programming Problem on Bound Convex Field

作　　者：马小华[1] 

机构地区：[1]西北第二民族学院预科部,宁夏银川750021

出　　处：《西北民族学院学报（自然科学版）》2000年第3期17-20,共4页Journal of Northwest Minorities University(Natural Science )

摘　　要：把非凸二次规划问题等价地转变成一个带有调整因子u的规划问题 ,特别当调空因子u取得适当大时 ,该问题转变成一个D、C规划问题 ,进而可以通过解凸二次规划来确定原问题整体最优值的下界 由此建立了有界凸域上非凸二次整体规划问题的单纯形剖分算法 。This paper turns nonconvex quadratic programming into the quadratic programming with an adjustable factor u,and when u is chosen adaptably,it is changed into a D.C.programming,and the lower bound can be determined by the solution of convex quadratic programming.According to the result,we build a simplex partition algotithm for nonconvex global quadratic programming problem on bound convex field,and give the convergent analysis of the algorithm.

关 键 词：单纯形剖分算法 非凸二次整体规划 有界凸域 

分 类 号：O221[理学—运筹学与控制论]