| 求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性 |
| |
| 引用本文： | 张明望,黄崇超. 求解一类非单调线性互补问题的宽邻域内点方法及其计算复杂性[J]. 运筹与管理, 2004, 13(2): 30-33 |
| |
| 作者姓名： | 张明望 黄崇超 |
| |
| 作者单位： | 1. 三峡大学,数学系,湖北,宜昌,443000
2. 武汉大学,应用数学系,湖北,武汉,430072 |
| |
| 基金项目： | 教育部骨干教师基金资助项目，湖北省教育厅重点科研基金资助项目(20022053012) |
| |
| 摘 要： | 对于一类非单调线性互补问题给出了一种新的算法——宽邻域内点算法，并讨论了其计算复杂性。
|
| 关 键 词： | 非单调线性互补问题 宽邻域内点算法 计算复杂性 P矩阵 |
| 文章编号： | 1007-3221(2004)02-0030-04 |
| 修稿时间： | 2003-08-21 |
A Wide-Neighborhood Interior Point Algorithm for Class A of Nonmonotonic Linear Complementary Problems and Its Computational Complexity |
| |
| ZHANG Ming-wang,HUANG Chong-chao. A Wide-Neighborhood Interior Point Algorithm for Class A of Nonmonotonic Linear Complementary Problems and Its Computational Complexity[J]. Operations Research and Management Science, 2004, 13(2): 30-33 |
| |
| Authors: | ZHANG Ming-wang HUANG Chong-chao |
| |
| Affiliation: | ZHANG Ming-wang~1,HUANG Chong-chao~2 |
| |
| Abstract: | 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. |
| |
| Keywords: | nonmonotonic linear complementary problem wide-neighborhood interior point algorithm P-matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
