| 一类0-1二次规划最优解的新算法 |
| |
| 引用本文： | 雍龙泉.一类0-1二次规划最优解的新算法[J].数学的实践与认识,2009,39(6). |
| |
| 作者姓名： | 雍龙泉 |
| |
| 作者单位： | 陕西理工学院数学系,陕西,汉中,723001 |
| |
| 摘 要： | 从矩阵的基础知识出发,给出了当目标函数矩阵是严格对角占优阵时,快速地获得0-1二次规划最优解的一个新算法;该方法具有很强的实用性,是此类问题的一个高效求解算法.
|
| 关 键 词： | 0-1二次规划 线性规划 严格对角占优矩阵 |
A New Method for Zero-one Quadratic Programming |
| |
| YONG Long-quan.A New Method for Zero-one Quadratic Programming[J].Mathematics in Practice and Theory,2009,39(6). |
| |
| Authors: | YONG Long-quan |
| |
| Abstract: | According to matrix theory,we propose a new method for zero-one quadratic programming whose matrix is strictly diagonally dominant in objective function.The algorithm is an efficient method because of its good practicability. |
| |
| Keywords: | Zero-one quadratic programming linear programming strictly diagonally dominant matrix |
| 本文献已被 万方数据 等数据库收录！ |
|
