On characterizing linear complementarity problems

Using a new bilinear programming formulation of the linear complementarity problem, the paper simplifies Mangasarian’s necessary and sufficient conditions under which these problems can be solved as linear programs. The present conditions are used to derive new special cases of linear complementarity problems that are solvable as linear programs. Finally, it indicates how they can be used to characterize matrix classes in complementarity theory.