Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/86626
Authors: 
van der Laan, Gerard
Talman, Dolf
Yang, Zaifu
Year of Publication: 
2005
Series/Report no.: 
Tinbergen Institute Discussion Paper 05-006/1
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.
Subjects: 
Discrete set
complementarity problem
algorithm
triangulation
JEL: 
C61
C62
C68
C72
C58
Document Type: 
Working Paper

Files in This Item:
File
Size
553.39 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.