Computing Integral Solutions of Complementarity Problems

Gerard van der Laan, Adolphus Talman and Zaifu Yang

No 05-006/1, Tinbergen Institute Discussion Papers from Tinbergen Institute

Abstract: This discussion paper resulted in a publication in 'Discrete Optimization', 2007, 4, 315-321.

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.

Keywords: Discrete set; complementarity problem; algorithm; triangulation (search for similar items in EconPapers)
JEL-codes: C58 C61 C62 C68 C72 (search for similar items in EconPapers)
Date: 2005-01-10
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
https://papers.tinbergen.nl/05006.pdf (application/pdf)

Related works:
Working Paper: Computing integral solutions of complementarity problems (2007)
Working Paper: Computing Integral Solutions of Complementarity Problems (2005)
Working Paper: Computing Integral Solutions of Complementarity Problems (2005)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tin:wpaper:20050006

Access Statistics for this paper

More papers in Tinbergen Institute Discussion Papers from Tinbergen Institute Contact information at EDIRC.
Bibliographic data for series maintained by Tinbergen Office +31 (0)10-4088900 ().