Research Article
A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps
Table 1
Numeric outcomes of our method.
| | | | Iter | Time (s) |
| | (0.3636, 0.4545, 0.4545, 0.3636) | (0, 0, 0, 0) | 1 | 0.0040 | | (0.3660, 0.4641, 0.4902, 0.4967, 0.4967, 0.4902, 0.4641, 0.3660) | (0, 0, 0, 0 0, 0, 0, 0) | 1 | 0.0050 |
|
|
