摘要
对于一类非单调线性互补问题给出了一种新的算法———宽邻域内点算法,并讨论了其计算复杂性。
In this paper, a new method for wide-neighborhood interior point algorithm for class A of nonmontonic linear complementary problems is developed. We also show that the method has polynomial time complexity.
出处
《运筹与管理》
CSCD
2004年第2期30-33,共4页
Operations Research and Management Science
基金
教育部骨干教师基金资助项目
湖北省教育厅重点科研基金资助项目(20022053012)
关键词
非单调线性互补问题
宽邻域内点算法
计算复杂性
P矩阵
nonmonotonic linear complementary problem
wide-neighborhood interior point algorithm
P-matrix
