A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS

1989
*
Journal of the Operations Research Society of Japan
*

In this paper, we first propose three practical algorithms for linear complementarity problems, which are based on the polynomial time method of Kojima, Mizuno and Yoshise (5), and compare them by showing the computational complexities. Then we modify two of the algorithms in order to accelerate them. Through the computational experiments for three types of linear complementarity problems, we compare the proposed algorithms in practice and see the efficiency of the modified algorithms. We also

doi:10.15807/jorsj.32.75
fatcat:y3nqpszml5eoxen7zyxtxa6ine