| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141603 | Discrete Optimization | 2007 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
Gerard van der Laan, Dolf Talman, Zaifu Yang,