Abstract
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. © 2007 Elsevier Ltd. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 315-321 |
Journal | Discrete Optimization |
Volume | 4 |
DOIs | |
Publication status | Published - 2007 |