Abstract: It has been shown in various papers that most interior-point algorithms for linear optimization and their analysis can be generalized to P_*(κ)- linear complementarity problems. This paper presents an extension of the recent variant of Mehrotra’s second order algorithm for linear optimijation. It is shown that the iteration-complexity bound of the algorithm is O
(4κ + 3)√14κ + 5 n log (x0)Ts0 ε , which is similar to that of the corresponding algorithm for linear optimization.