Computing Integral Solutions of Complementarity Problems

This discussion paper resulted in a publication in 'Discrete Optimization', 2007, 4, 315-321.<P> In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral solution of the complementarity problem under consideration.