A note on linear complementarity problems and multiple objective programming

被引：0
作者：
S.R. Mohan
S.K. Neogy
A.K. Das
机构：
[1] Indian Statistical Institute,
[2] Indian Statistical Institute,undefined
来源：
Mathematical Programming | 2004年 / 100卷
关键词：
linear complementarity problem; lemke’s algorithm; LCP-related weighted problem; multiple objective programming problem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：339 / 344
页数：5
相关论文
共 5 条
  • [1] Kostreva undefined(1993)undefined Math. Program. 60 349-undefined
  • [2] Isac undefined(1995)undefined J. optim. theory and applications 86 389-undefined
  • [3] Lemke undefined(1965)undefined Manage. Sci. 11 681-undefined
  • [4] Lemke undefined(1964)undefined J. Soc. Industrial and Appl. Math. 12 413-undefined
  • [5] Mangasarian undefined(1978)undefined Math. Program. study 7 74-undefined
1