A note on linear complementarity problems and multiple objective programming

被引：4

作者：

Mohan, SR ^{[1
]}

Neogy, SK

Das, AK

机构：

[1] Indian Stat Inst, New Delhi 110016, India

[2] Indian Stat Inst, Kolkata 700035, W Bengal, India

来源：

MATHEMATICAL PROGRAMMING | 2004年 / 100卷 / 02期

关键词：

linear complementarity problem; lemke's algorithm; LCP-related weighted problem; multiple objective programming problem;

D O I：

10.1007/s10107-003-0473-8

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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

页数：6

共 8 条

[1]

Bazaraa MokhtarS., 1979, Nonlinear Programming: Theory and Algorithms

[2]

Cottle R, 1992, The Linear Complementarity Problem

[3] MULTIPLE-OBJECTIVE APPROXIMATION OF FEASIBLE BUT UNSOLVABLE LINEAR COMPLEMENTARITY-PROBLEMS [J].