| Article ID: | iaor19941941 |
| Country: | Netherlands |
| Volume: | 60 |
| Issue: | 3 |
| Start Page Number: | 349 |
| End Page Number: | 359 |
| Publication Date: | Jul 1993 |
| Journal: | Mathematical Programming (Series A) |
| Authors: | Kostreva Michael M., Wiecek Malgorzata M. |
| Keywords: | linear complementarity |
An equivalence is demonstrated between solving a linear complementarity problem with general data and finding a certain subset of the efficient points of a multiple objective programming problem. A new multiple objective programming based approach to solving linear complementarity problems is presented. Results on existence, uniqueness and computational complexity are included.