The classes of L1-matrices, L2-matrices, L3-matrices and W-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example.
