论文部分内容阅读
A modified sequential linear programming algorithm is presented, whose subproblem is always solvable, for the extended linear complementarity problem ( XLCP ),the global convergence of the algorithm under assumption of X-row sufficiency or X-column monoto