In this study, we implement a variant of infeasible interior-point algorithm for solving monotone linear complementarity problems (LCP). We first reformulate the LCP as an minimization problem. Then descent iterative method is applied to latter. The direction computed via Newton method. However, maintaining positivity iterates, novel and efficient strategy proposed. Some numerical results are r...