摘要
本文对M∈Z时的线性互补问题提出一种新的算法——最小元算法.此算法比现行的R.Chandrasekaran算法和化这类问题成线性规划问题的方法具有更广的适用范围,而且对于退化情形仍然有效.
A new method, the least element algorithm, is considered for the linear complementarityproblems when M∈Z. This algorithm has a wider range of applications than R. Chan-drasekaran's algorithm and the method of transforming this kind of problems to linear pro-gramming problems. It is also efficient for the case of degeneracy.
出处
《计算数学》
CSCD
北大核心
1992年第2期167-172,共6页
Mathematica Numerica Sinica
