A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps

Table 5

The execution time for the different methods.

	Lemke	Interior point	Proposed algorithm
10	5	23	0.00447
20	8	34	0.005160
50	14	56	0.014906
100	32	148	0.030162
200	74	289	0.04148
400	126	518	0.110811
500	159	665	0.177190
1000	334	875	0.928443