New algorithm for solving the general quadratic programming problem

被引：0
|
作者：
Horst, Reiner [1 ]
Thoai, Nguyen Van [1 ]
机构：
[1] Univ of Trier, Trier, Germany
来源：
Computational Optimization and Applications | 1996年 / 5卷 / 01期
关键词：
Algorithms - Problem solving;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
For the general quadratic programming problem (including an equivalent form of the linear complementarity problem) a new solution method of branch and bound type is proposed. The branching procedure uses a well-known simplicial subdivision and the bound estimation is performed by solving certain linear programs.
引用
收藏
页码：39 / 48
相关论文
共 50 条
12345