eprintid: 449
rev_number: 15
eprint_status: archive
userid: 7
dir: disk0/00/00/04/49
datestamp: 2011-07-27 09:05:45
lastmod: 2014-07-17 12:51:46
status_changed: 2011-07-27 09:05:45
type: article
metadata_visibility: show
item_issues_count: 0
creators_name: De Schutter, Bart
creators_name: Heemels, W.P.M.H.
creators_name: Bemporad, Alberto
creators_id: 
creators_id: 
creators_id: alberto.bemporad@imtlucca.it
title: On the equivalence of linear complementarity problems
ispublished: pub
subjects: QA
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Complementarity problems; Nonlinear algorithms; Integer programming; Optimization; Linear complementarity problem
abstract: We show that the Extended Linear Complementarity Problem (ELCP) can be recast as a standard Linear Complementarity Problem (LCP) provided that the surplus variables or the feasible set of the ELCP are bounded. Since many extensions of the LCP are special cases of the ELCP, this implies that these extensions can be rewritten as an LCP as well. Our equivalence proof is constructive and leads to three possible numerical solution methods for a given ELCP: regular ELCP algorithms, mixed integer linear programming algorithms, and regular LCP algorithms.
date: 2002-08
date_type: published
publication: Operations Research Letters
volume: 30
number: 4
publisher: Elsevier
pagerange: 211-222
id_number: 10.1016/S0167-6377(02)00159-1
refereed: TRUE
issn: 0167-6377
official_url: http://www.sciencedirect.com/science/article/pii/S0167637702001591
citation:   De Schutter, Bart and Heemels, W.P.M.H. and Bemporad, Alberto  On the equivalence of linear complementarity problems.  Operations Research Letters, 30 (4).  pp. 211-222.  ISSN 0167-6377      (2002)