Computational Complexity of Complementary Pivot Methods

@inproceedings{ComputationalCO,
  title={Computational Complexity of Complementary Pivot Methods},
  author={}
}
    In this Chapter, we discuss the worst case behavior of the computational growth requirements of the complementary and principal pivot methods for solving LCPs, as a function of n, the order, and the size of the LCP. These results are from K. G. Murty 6.5]. We construct a class of LCPs with integer data, one of order n for each n > = 2, and prove that the… CONTINUE READING