|
|||||
|
|
Linear complementarity problems and multiple objective programming |
|
| Authors: | Michael M. Kostreva Malgorzata M. Wiecek |
| Affiliation: | (1) Department of Mathematical Sciences, Clemson University, 29634-1907 Clemson, SC, USA |
| Abstract: | 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. |
| Keywords: | linear complementarity problems efficient solutions multiple objective programming computational complexity |
| 本文献已被 SpringerLink 等数据库收录！ | |