Computing integral solutions of complementarity problems

G. van der Laan; A.J.J. Talman; Z. Yang

doi:10.1016/j.disopt.2007.09.001

Computing integral solutions of complementarity problems

G. van der Laan
, A.J.J. Talman
, Z. Yang

Research output: Contribution to Journal › Article › Academic

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	https://doi.org/10.1016/j.disopt.2007.09.001
Publication status	Published - 2007

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 16 Peace, Justice and Strong Institutions

Access to Document

10.1016/j.disopt.2007.09.001

Persistent URL (handle)

Persistent link

Cite this

@article{c94e12954a6a4b97a9a7751655110fea,

title = "Computing integral solutions of complementarity problems",

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. {\textcopyright} 2007 Elsevier Ltd. All rights reserved.",

author = "\{van der Laan\}, G. and A.J.J. Talman and Z. Yang",

year = "2007",

doi = "10.1016/j.disopt.2007.09.001",

language = "English",

volume = "4",

pages = "315--321",

journal = "Discrete Optimization",

issn = "1572-5286",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Computing integral solutions of complementarity problems

AU - van der Laan, G.

AU - Talman, A.J.J.

AU - Yang, Z.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

U2 - 10.1016/j.disopt.2007.09.001

DO - 10.1016/j.disopt.2007.09.001

M3 - Article

SN - 1572-5286

VL - 4

SP - 315

EP - 321

JO - Discrete Optimization

JF - Discrete Optimization

ER -

Computing integral solutions of complementarity problems

Abstract

UN SDGs

Access to Document

Persistent URL (handle)

Fingerprint

Cite this