Equivalence Between Different Formulations of the Linear Complementarity Problem

One shows that different formulations of the linear complementarity problem (LCP), such as the horizontal LCP, the mixed LCP and the geometric LCP can be transformed into a standard LCR The P*(k)-property (a more general property than monotonicity) of the corresponding formulations as well as the convergence properties of a large class of interior-point algorithms are invariant with respect to the transformations. Therefore it is sufficient to study the algorithms only for the standard LC