A note on linear complementarity problems and multiple objective programming (Q1881564)

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