Abstract We present a path-following interior-point algorithm for solving the weighted linear complementarity problem from implementation point of view. studied two variants, which differ only in method updating parameter characterizes central path. The was done C++ programming language and obtained numerical results prove efficiency proposed method.