Abstract
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 language | English |
---|---|
Pages (from-to) | 409-417 |
Number of pages | 9 |
Journal | European Journal of Operational Research |
Volume | 158 |
Issue number | 2 |
DOIs | |
Publication status | Published - 16 Oct 2004 |
Keywords
- 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