Unified approaches for solvable and unsolvable linear complementarity problems

M. M. Kostreva, Xiaoqi Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

12 Citations (Scopus)


In this paper, general linear complementarity problems (LCPs) are studied via global optimization problems. In particular, unsolvable LCPs are reformulated as multicriteria optimization, minimax optimization and quadratic programming problems. The solvability and unsolvability of LCPs are obtained via these reformulations. Furthermore, first-order and second-order global optimality conditions of LCPs are derived. Some examples are also given to demonstrate these optimality conditions.
Original languageEnglish
Pages (from-to)409-417
Number of pages9
JournalEuropean Journal of Operational Research
Issue number2
Publication statusPublished - 16 Oct 2004


  • Linear complementarity problem
  • Minimax optimization
  • Multicriteria optimization
  • Quadratic programming

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


Dive into the research topics of 'Unified approaches for solvable and unsolvable linear complementarity problems'. Together they form a unique fingerprint.

Cite this