| 有界凸域上非凸二次整体规划问题的单纯形剖分算法 |
| |
| 引用本文： | 马小华.有界凸域上非凸二次整体规划问题的单纯形剖分算法[J].西北民族学院学报,2000,21(3):17-20. |
| |
| 作者姓名： | 马小华 |
| |
| 作者单位： | 西北第二民族学院预科部,宁夏银川 |
| |
| 摘 要： | 把非凸二次规划问题等价地转变成一个带有调整因子u的规划问题 ,特别当调空因子u取得适当大时 ,该问题转变成一个D、C规划问题 ,进而可以通过解凸二次规划来确定原问题整体最优值的下界 由此建立了有界凸域上非凸二次整体规划问题的单纯形剖分算法 ,并对此算法的收敛性进行了分析
|
| 关 键 词： | 凸二次规划 非凸二次规划 整体最优化分枝定界技术 单纯形剖分算法 |
A Simplex Partition Algorithm for Nonconvex Global Quadratic Programming Problem on Bound Convex Field |
| |
| MA Xiao,hua.A Simplex Partition Algorithm for Nonconvex Global Quadratic Programming Problem on Bound Convex Field[J].Journal of Northwest Minorities University(Natural Science ),2000,21(3):17-20. |
| |
| Authors: | MA Xiao hua |
| |
| Abstract: | 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. |
| |
| Keywords: | convex quadratic programming nonconvex quadratic programming global optimization branch bound technology simplex partition |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
