| 摘要: |
| 以矩阵为基础,给出当目标函数中的矩阵满足一定性质时,快速获得0-1二次规划最优解的一种新解法,并用实例说明解法的有效性和实用性.该解法在很大程度上丰富了0-1二次规化的数值实验. |
| 关键词: 线性规划 0-1二次规划 矩阵 最优解 |
| DOI： |
| 投稿时间：2007-06-15修订日期：2007-08-24 |
| 基金项目:陕西理工学院科研基金项目(SLGQD0517)资助 |
|
| A New Method for Unconstraint Quadratic Zero-one Programming |
|
YONG Long-quan
|
| (Department of Mathematics, Shaanxi University of Technology, Hanzhong, Shaanxi, 723001, China) |
| Abstract: |
| According to matrix theory, a new method for unconstraint quadratic zero-one programming whose matrix possess some characteristic in objective function is proposed.The algorithm is an efficient method because of its good practicability. |
| Key words: linear programming zero-one quadratic programming matrix optimal solution |
