| Article ID: | iaor20052808 |
| Country: | Netherlands |
| Volume: | 158 |
| Issue: | 2 |
| Start Page Number: | 409 |
| End Page Number: | 417 |
| Publication Date: | Oct 2004 |
| Journal: | European Journal of Operational Research |
| Authors: | Kostreva Michael M., Yang X.Q. |
| Keywords: | programming: multiple criteria, programming: quadratic |
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.