Complementarity Pivot Methods
This chapter deals with pivot methods that constituted the first and important instrument in solving Linear Complementarity Problems. Developed under the impact of the simplex method, they revealed many crucial differences between the linear programming and complementarity problems.
KeywordsComplementarity Problem Basic Solution Linear Complementarity Problem Direct Algorithm Complementary Basis
Unable to display preview. Download preview PDF.
- Eaves, B.C. 1. “The linear complementarity problem in mathematical programming,” Research Report 69–4, Operations Research House, Stanford University, Stanford, California, 1969.Google Scholar
- Eaves, B.C. 4. ‘A short course in solving equations with PL homotopies.’- In: Nonlinear Programming, Vol. IX, SIAM-AMS Proceedings, R.W. Cottle and C.E. Lemke, eds. American Mathematical Society, Providence, 1976.Google Scholar
- Kostreva, M.M. 1. “Direct algorithms for complementarity problems,” Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, N.Y., 1976.Google Scholar
- Lemke CB. 2. “On complementarity pivot theory,” RPI Math Report No. 76, Rensselaer Polytechnic Institute, Troy, New York, 1967.Google Scholar
- Lemke CB. 3. ‘On Complementarity Pivot Theory’.- In: Mathematics of the Decisidn Sciences, G.B. Dantzig and A.F. Veinott Jr., eds., American Mathematical Society, Providence, Rhode Island, 1968.Google Scholar
- Murty, K.G. 1. “On the number of solutions to the complementarity quadratic programming problem,” Doctoral Dissertation, Engineering Science, University of California, Berkeley, 1968.Google Scholar
- Todd, M.J. 1. “Dual families of linear programs,” Technical Report No. 197, Department of Operations Research, Cornell University, 1973.Google Scholar