1. R. Chandrasekharan, “A special case of the complementary pivot problem”, Opsearch, 7 (1970) 263–268.
2. R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming”, Linear Algebra and Its Applications 1 (1968) 103–125.
3. V. Klee and G.J. Minty, “How good is the simplex algorithm”, in: O. Shisha, ed., Inequalities III (Academic Press, New York, 1972) pp. 159–175.
4. M.M. Kostreva, “Direct algorithms for complementarity problems”, Dissertation, Rensselaer Polytechnic Institute, Troy, New York, June 1976.
5. C.E. Lemke, “Bimatrix equilibrium points and mathematical programming”, Management Science 4 (1965) 681–689.