A note on linear complementarity problems and multiple objective programming

Kostreva and Wiecek [3] introduced a problem called LCP-related weighted problem in connection with a multiple objective programming problem, and suggested that a given linear complementarity problem (LCP) can be solved by solving the LCP-related weighted problem associated with it. In this note we...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical programming Ročník 100; číslo 2; s. 339 - 344
Hlavní autoři: Mohan, S.R., Neogy, S.K., Das, A.K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Heidelberg Springer 01.06.2004
Springer Nature B.V
Témata:
Algorithms
Applied sciences
Control theory
Exact sciences and technology
Game theory
Linear programming
Mathematical analysis
Mathematical programming
Operational research and scientific management
Operational research. Management science
Studies
Problem solving
Linear complementarity problem
Multiobjective programming
Mathematical programming
ISSN:0025-5610, 1436-4646
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Kostreva and Wiecek [3] introduced a problem called LCP-related weighted problem in connection with a multiple objective programming problem, and suggested that a given linear complementarity problem (LCP) can be solved by solving the LCP-related weighted problem associated with it. In this note we provide several clarifications of the claims made in [3]. Finally, we feel that solving any LCP by the approach given in [3] may not be as useful as it is claimed. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-003-0473-8