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...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical programming Vol. 100; no. 2; pp. 339 - 344
Main Authors: Mohan, S.R., Neogy, S.K., Das, A.K.
Format: Journal Article
Language:English
Published: Heidelberg Springer 01.06.2004
Springer Nature B.V
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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]
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0025-5610
1436-4646
DOI:10.1007/s10107-003-0473-8