ISSN:
1573-2878
Keywords:
Linear complementarity problems
;
multiple-objective programming
;
efficient points
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract Using a multiple-objective framework, feasible linear complementarity problems (LCPs) are handled in a unified manner. The resulting procedure either solves the feasible LCP or, under certain conditions, produces an approximate solution which is an efficient point of the associated multiple-objective problem. A mathematical existence theory is developed which allows both specialization and extension of earlier results in multiple-obkective programming. Two perturbation approaches to finding the closest solvable LCPs to a given unsolvable LCP are proposed. Several illustrative examples are provided and discussed.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02192086
Permalink