The linear complementarity problem as a separable bilinear program


The nonmonotone linear complementarity problem (LCP) is formulated as a bilinear program with separable constraintsand an objective function that minimizesa natural error residual for the LCP. A linear-programming-basedalgorithm applied to the bilinear program terminates in a nite number of steps at a solution or stationary point of the problem. The bilinear algorithm solved 80 consecutive cases of the LCP formulationof the knapsack feasibility problem ranging in size between 10 and 3000, with almost constant average number of major iterations equal to four.


1 Figures and Tables

Download Full PDF Version (Non-Commercial Use)