Some numerical aspects on a method for solving linear problems with complementarity constraints

A known method for solving linear problems with complementarity constraints is briefly recalled. The method decomposes the given problem in a sequence of parameterized problems and - by means of suitable cuts - allows to define an iterative procedure that leads to an optimal solution or to an approximation of it providing an estimate of the error. In this paper, for problems of different dimensions we have implemented some numerical experiments which show that in most cases the method converges linearly with respect to the dimension of the problem. Our results are also compared with those obtained by similar approaches where different kinds of cuts are considered.