scientific article; zbMATH DE number 2033481

MaRDI QIDQ4444671zbMATH OpenFDO

Authors Leonid Denisovich Popov

Publication date 27 January 2004

zbMATH Keywords

Chebyshev quasisolutionLemke methodlinar complementarity problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Extreme-point and pivoting methods (90C49)

Review text

The author considers the linear complementarity problem for finding \(w\) and \(z\) in \(\mathbb{R}^n\) satisfying the following conditions: \[ w= q+ Mz,\quad w\geq 0,\;z\geq 0,\qquad w^T z= 0,\tag{1} \] in which the constraints (1) are inconsistent. He introduces the notion of Chebyshev quasisolutions and derives the conditions under which these quasisolutions of the problem can be found by the Lemke iterative method due to \textit{C. E. Lemke} [Math. Program. Study 7, 15--35 (1978; Zbl 0381.90073)].

Recommendations

• On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method
• scientific article; zbMATH DE number 3945904
• Iterative methods of solutions for linear and quasi-linear complementarity problems
• The quasi-complementarity problem
• scientific article; zbMATH DE number 2145258

Cited in

(1)

• On quasi-solution to infeasible linear complementarity problem obtained by Lemke's method

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4444671)