The Extended Linear Complementarity Problem

Reference

B. De Schutter and B. De Moor, "The Extended Linear Complementarity Problem," Mathematical Programming, vol. 71, no. 3, pp. 289-325, Dec. 1995.

Abstract

In this paper we define the Extended Linear Complementarity Problem (ELCP), an extension of the well-known Linear Complementarity Problem (LCP). We show that the ELCP can be viewed as a kind of unifying framework for the LCP and its various generalizations. We study the general solution set of an ELCP and we develop an algorithm to find all its solutions. We also show that the general ELCP is an NP-hard problem.

Downloads

Bibtex entry

@article{DeSDeM:93-69,
author={B. {D}e Schutter and B. {D}e Moor},
title={The Extended Linear Complementarity Problem},
journal={Mathematical Programming},
volume={71},
number={3},
pages={289--325},
month=dec,
year={1995},
doi={10.1007/BF01590958}
}


Go to the publications overview page.

This page is maintained by Bart De Schutter. Last update: February 21, 2026.