A note on linear complementarity problems and multiple objective programming (Q1881564): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-003-0473-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2141001496 / rank | |||
Normal rank | |||
Latest revision as of 00:05, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on linear complementarity problems and multiple objective programming |
scientific article |
Statements
A note on linear complementarity problems and multiple objective programming (English)
0 references
5 October 2004
0 references
\textit{M. M. Kostreva} and \textit{M. M. Wiecek} [ibid. 60, No. 3, 349--359 (1993; Zbl 0796.90047)] introduced a problem called LCP-related weighted problem in connection with a quadratic multiobjective problem, and suggested that an LCP can be solved by solving the LCP-related weighted problem associated with it, by e.g. Lemke's algorithm. This note provides several clarifications of the claims made in [loc. cit.], and shows by examples that solving an LCP by the approach given in [loc. cit.] may not be as useful as it is claimed.
0 references
linear complementarity problem
0 references
Lemke's algorithm
0 references
LCP-related weighted problem
0 references
multiple objective programming problem
0 references
