A New Type Algorithm for the Generalized Linear Complementarity Problem Over a Polyhedral Cone In Engineering and Equilibrium Modeling

In this paper, we consider a new type algorithm for the generalized linear complementarity problem over a polyhedral cone in engineering and economic equilibrium modeling(GLCP). To this end, we first develop some equivalent reformulations of the problem under milder conditions, and then an easily computable global error bound for the GLCP is established, which can be viewed as extensions of previously known results. Based on this, we propose a new type of solution method to solve the GLCP, and show that the algorithm is global and R-linear convergence. Some numerical experiments of the algorithm are also reported in this paper.