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