Abstract
In this paper, the global error bound estimation for the generalized linear complementarity problem over a polyhedral cone (GLCP) is considered. To obtain a global error bound for the GLCP, we first develop some equivalent reformulations of the problem under milder conditions and then characterize the solution set of the GLCP. Based on this, an easily computable global error bound for the GLCP is established. The results obtained in this paper can be taken as an extension of the existing global error bound for the classical linear complementarity problems.
Original language | English |
---|---|
Pages (from-to) | 417-429 |
Number of pages | 13 |
Journal | Journal of Optimization Theory and Applications |
Volume | 142 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Jul 2009 |
Keywords
- GLCP
- Global error bound
- Reformulation
- Solution structure
ASJC Scopus subject areas
- Applied Mathematics
- Control and Optimization
- Management Science and Operations Research