On solving linear complementarity problems as linear programs

DOI10.1007/BFb0120784zbMath0381.90072OpenAlexW1548220668MaRDI QIDQ4161082

Publication date: 1978

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120784

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Polytopes and polyhedra (52Bxx)

Related Items

On some classes of matrices related to solving linear complementarity problems as linear programs, Unified approaches for solvable and unsolvable linear complementarity problems, An algebra-based approach for linearly constrained concave minimization, Iterative methods for variational and complementarity problems, New contraction methods for linear inequalities, Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods, Some Equivalences Among Nonlinear Complementarity Problems, Least-Element Problems, and Variational Inequality Problems in Ordered Spaces, On the equivalence of nonlinear complementarity problems and least-element problems, On characterizing linear complementarity problems as linear programs, A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix, Sufficient matrices and the linear complementarity problem, Continuous Selections of Solutions to Parametric Variational Inequalities, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Linear-step solvability of some folded concave and singly-parametric sparse optimization problems, Matrices and the linear complementarity problem, New methods for linear inequalities, Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\), The equivalence of an LCP to a parametric linear program with a scalar parameter, Equivalence of vertical block linear complementarity problems and multi-objective programming problems, Newton's method for linear complementarity problems, Linear complementarity problems and multiple objective programming, Convergence of the cyclical relaxation method for linear inequalities, On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem, On a class of least-element complementarity problems, A new concave minimization algorithm for the absolute value equation solution, Hidden Z-matrices with positive principal minors, On the equivalence of extended generalized complementarity and generalized least-element problems, The vector complementary problem and its equivalences with the weak minimal element in ordered spaces, A finite improvement algorithm for the linear complementarity problem, Generalized linear complementarity problems treated without fixed-point theory, A simultaneous projections method for linear inequalities, A note on sufficient conditions for \(Q_ 0\) and \(Q_ 0\cap P_ 0\) matrices, Linear, quadratic, and bilinear programming approaches to the linear complementarity problem