| 整凸二次规划 |
| |
| 引用本文： | 赵军 唐恒永. 整凸二次规划[J]. 辽宁大学学报(自然科学版), 1995, 22(4): 16-22 |
| |
| 作者姓名： | 赵军 唐恒永 |
| |
| 作者单位： | [1]沈阳大学基础部 [2]沈阳师范学院数学计算机系 |
| |
| 摘 要： | 本文给出了一种求解整凸二次规划的分枝定界法，该算法把松弛问题转化为线性互补问题，由于求解线性互补问题时，充分地利用了前一分枝点所对应的线性互补问题解的信息，从而地减少了计算量。
|
| 关 键 词： | 整凸二次规划 松弛问题 线性相补问题 二次规划 |
IntegerConvexQuadratic Programming |
| |
| ZhaoJun Shenyang University Tang Hengyong Shenyang Teachers College. IntegerConvexQuadratic Programming[J]. Journal of Liaoning University(Natural Sciences Edition), 1995, 22(4): 16-22 |
| |
| Authors: | ZhaoJun Shenyang University Tang Hengyong Shenyang Teachers College |
| |
| Affiliation: | ZhaoJun Shenyang University Tang Hengyong Shenyang Teachers College |
| |
| Abstract: | In this paper a branch- and-bound method for integer convex quadratic programming is given,The algorithm transforms the relaxed ptoblems into alinear complementary problem,the information about branch point corresponds to the solution of the linear complementary problem is precedingly fully utilized,so the amount of calculation is reduced enormously. |
| |
| Keywords: | Integer convex quadratic programming Branch-and-bound method Relaxed problem Linear complementary problem. |
| 本文献已被 CNKI 维普 等数据库收录！ |
