A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
From MaRDI portal
Cited in
(16)- The existence of maximum and minimum solutions to general variational inequalities in the Hilbert lattices
- Complementary irreducibilityS– matrices with connections to solutions of the linear complementarity problem
- A note on an open problem in linear complementarity
- On the equivalence of nonlinear complementarity problems and least-element problems
- Equilibrium problems with generalized monotone bifunctions and applications to variational inequalities
- Some equivalences among nonlinear complementarity problems, least-element problems, and variational inequality problems in ordered spaces
- A finite improvement algorithm for the linear complementarity problem
- Matrices and the linear complementarity problem
- The equivalence of an LCP to a parametric linear program with a scalar parameter
- Equivalence of generalized mixed complementarity and generalized mixed least element problems in ordered spaces
- On the equivalence of extended generalized complementarity and generalized least-element problems
- A characterization of an \(n\) by \(2n\) ``\(Q_0\)-matrix
- Finding the Least Element of a Nonnegative Solution Set of a Class of Polynomial Inequalities
- Vector equilibrium problems, minimal element problems and least element problems
- An extension of Tarski's fixed point theorem and its application to isotone complementarity problems
- Equivalence of equilibrium problems and least element problems
This page was built for publication: A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166569)
