Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference13 articles.
1. R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming”,Linear Algebra and Its Applications 1 (1968) 103–125.
2. R.W. Cottle, “Monotone solutions of the parametric linear complementarity problem”,Mathematical Programming 3 (1972) 210–224.
3. V. Klee and G.L. Minty, “How good is the simplex algorithm”, in: O. Shisha, ed.,Inequalities III (Academic Press, New York, 1976).
4. M.M. Kostreva, “Direct algorithms for complementarity problems”, Dissertation, Rennselaer Polytechnic Institute (Troy, New York, 1976).
5. C.E. Lemke, “Bimatrix equilibrium points and mathematical programming”,Management Science 4 (1965) 681–689.
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献