TY  - JOUR
N2  - 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.
SN  - 0167-6377
UR  - http://www.sciencedirect.com/science/article/pii/S0167637702001591
TI  - On the equivalence of linear complementarity problems
AV  - none
KW  - Complementarity problems; Nonlinear algorithms; Integer programming; Optimization; Linear complementarity problem
EP  - 222
ID  - eprints449
SP  - 211
A1  - De Schutter, Bart
A1  - Heemels, W.P.M.H.
A1  - Bemporad, Alberto
PB  - Elsevier
IS  - 4
JF  - Operations Research Letters
Y1  - 2002/08//
VL  - 30
ER  -