ISSN:
1436-4646
Keywords:
linear complementarity problems
;
efficient solutions
;
multiple objective programming
;
computational complexity
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580619