摘要
将二次规划中K-T点复杂性问题转化为线性互补复杂性问题,并结合背包问题得出二次规划是NP难问题.
The computational complexity problem of K-T point in quadratic programming is trarisformed into linear eomplementarity＇s computational complexity problem, and combining with knapsack problem, we obtained that quadratic programming is an NP-hard problem.
出处
《喀什师范学院学报》
2006年第3期8-9,共2页
Journal of Kashgar Teachers College
基金
陕西理工学院重点资助项目(SLGQD0517)
关键词
二次规划
K-T点
线性互补
背包问题
NP难问题
Quadratic programming
K-T point
Linear complementarity
Knapsack problem
NP-hard problem
