The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems

[1] A. A. Akkeleş, L. Balogh, T. Illés, New variants of the criss-cross method for linearly constrained convex quadratic programming, Eur. J. Oper. Res., 157, 1 (2004) 74-86. →10410.1016/j.ejor.2003.08.008Search in Google Scholar

[2] K. J. Arrow, G. Debreu, Existence of an equilibrium for competitive economy, Econometrica, 22 (1954) 265-290. →13310.2307/1907353Search in Google Scholar

[3] K. Cameron, J. Edmonds, Existentially polytime theorems, in: Polyhedral combinatorics, (eds. W. Cook, P.D. Seymour) DIMACS Ser. Discrete Math. Theoret. Comput. Sci., American Mathematical Society, Providence, RI, 1990, pp. 83-100. →126Search in Google Scholar

[4] Y. Y. Chang, Least index resolution of degeneracy in linear complementarity problems, Technical Report 79-14, Department of Operations Research, Stanford University, Stanford, Calfornia, USA, 1979. →104Search in Google Scholar

[5] S. J. Chung, NP-completeness of the linear complementarity problem, J. Optimiz. Theory Appl., 60, 3 (1989) 393-399. →11010.1007/BF00940344Search in Google Scholar

[6] R. W. Cottle, J. S. Pang, V. Venkateswaran, Sufficient matrices and the linear complementarity problem, Linear Algebra Appl., 114/115 (1989) 231-249. → 104, 107, 10810.1016/0024-3795(89)90463-1Search in Google Scholar

[7] Zs. Csizmadia, New pivot based methods in linear optimization, and an application in petroleum industry, PhD Thesis, Eötvös Loránd University of Sciences, 2007. →137Search in Google Scholar

[8] Zs. Csizmadia, T. Illés, New criss-cross type algorithms for linear complementarity problems with sufficient matrices, Optim. Methods Softw., 21, 2 (2006) 247-266. →106, 109, 11410.1080/10556780500095009Search in Google Scholar

[9] Zs. Csizmadia, T. Illés, A. Nagy, The s-monotone index selection rules for pivot algorithms of linear programming, European J. Oper. Res., 221, 3 (2012) 491-500. →104, 106, 111, 11210.1016/j.ejor.2012.02.008Search in Google Scholar

[10] Gy. Farkas, A Fourier-féle mechanikai elv alkalmazásai (the applications of the mechanical principle of fourier), Mathematikai és Természettudományi Értesítő, 12 (1894) 457-472. →105, 110Search in Google Scholar

[11] Gy. Farkas, Theorie der einfachen ungleichungen, J. Reine Angew. Math., 124 (1901) 1-27. →105, 11010.1515/crll.1902.124.1Search in Google Scholar

[12] K. Fukuda, M. Namiki, A. Tamura, EP theorems and linear complementarity problems, Discrete Appl. Math., 84, 1-3 (1998) 107-119. →105, 107, 108, 109, 126, 13610.1016/S0166-218X(97)00143-1Search in Google Scholar

[13] K. Fukuda T. Terlaky, Linear complementarity and oriented matroids, J. Oper. Res. Soc. Japan, 35, 1 (1992) 45-61. →105, 110, 13610.15807/jorsj.35.45Search in Google Scholar

[14] D. den Hertog, C. Roos, T. Terlaky, The linear complementarity problem, sufficient matrices, and the criss-cross method, Linear Algebra Appl., 187, 1 (1993) 1-14. →104, 107, 10910.1016/0024-3795(93)90124-7Search in Google Scholar

[15] T. Illés, A. Nagy, Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules, Department of Operations Research, Eötvös Loránd University of Sciences, Operations Research Report, 2012-02 (2012) submitted for publication. →132Search in Google Scholar

[16] T. Illés, M. Nagy, T. Terlaky, EP theorem for dual linear complementarity problems, J. Optim. Theory Appl., 140, 2 (2009) 233-238. →10510.1007/s10957-008-9440-0Search in Google Scholar

[17] T. Illés, M. Nagy, T. Terlaky, Polynomial interior point algorithms for general linear complementarity problems, Algorithmic Oper. Res.h, 5, 1 (2010) 1-12. → 105Search in Google Scholar

[18] T. Illés, M. Nagy, T. Terlaky, A polynomial path-following interior point algorithm for general linear complementarity problems, J. Global Optim., 47, 3 (2010) 329-342. →10510.1007/s10898-008-9348-0Search in Google Scholar

[19] E. Klafszky, T. Terlaky, The role of pivoting in proving some fundamental theorems of linear algebra, Linear Algebra Appl., 151 (1991) 97-118. →108, 11910.1016/0024-3795(91)90356-2Search in Google Scholar

[20] M. Kojima, N. Megiddo, T. Noma, A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science 538, Springer-Verlag, Berlin, 1991. →104, 10510.1007/3-540-54509-3Search in Google Scholar

[21] C.E. Lemke, J.T. Howson, Jr., Equilibrium points of bimatrix games, Journal Soc. Indust. Appl. Math., 12 (1964) 413-423. →13410.1137/0112033Search in Google Scholar

[22] C. Roos, T. Terlaky, J.-Ph. Vial, Theory and Algorithms for Linear Optimization: An Interior Point Approach, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, USA, 1997. Second edition: Interior PointMethods for Linear Optimization, Springer, New York, 2006. → 105Search in Google Scholar

[23] T. Terlaky, A convergent criss-cross method, Optimization, 16, 5 (1985) 683-690. →10410.1080/02331938508843067Search in Google Scholar

[24] P. Tseng, Co-NP-completeness of some matrix classification problems, Math. Program., Series A:88 (2000) 183-192. →10410.1007/s101070000159Search in Google Scholar

[25] Y. Ye, A Path to the Arrow-Debreu Competitive Market Equilibrium, Math. Program., 111, 1-2 (2008) 315-348. →13310.1007/s10107-006-0065-5Search in Google Scholar

[26] H. Väliaho, Criteria for sufficient matrices, Linear Algebra Appl., 233 (1996) 109-129. →104, 10910.1016/0024-3795(94)00058-1Search in Google Scholar

[27] H. Väliaho, P.-matrices are just sufficient, Linear Algebra Appl., 239 (1996) 103-108. →104[28] L. Walras, Elements of Pure Economics, or the Theory of Social Wealth, (1874) (1899, 4th ed.; 1926, rev. ed., 1954, Engl. Transl.) →132Search in Google Scholar

[29] Z.M. Wang, A finite conformal-elimination free algorithm over oriented matroid programming, Chin. Ann. Math. Ser. B, 8, 1 (1987) 120-125. →104 Search in Google Scholar