Reducing a monotone horizontal LCP to an LCP Original Research Article

In this note, we show how to reduce a monotone horizontal linear complementarity problem to a (standard) monotone linear complementarity problem. The main steps involved in this reduction are: finding a maximal linearly independent column set of a given matrix (or equivalently, converting a matrix to its reduced row echelon form) and inverting a nonsingular matrix.