Abstract
The linear complementarity problem is that of finding an n x 1 vector z such that
Mz+q≧0, z≧0, zT (Mz+q)=0 where M is a given n x n real matrix and q is a given n x 1 vector. In this paper the class of matrices M for which this problem is solvable by a single linear program is enlarged to include matrices other than those that are z-matrices or those that have an inverse which is a z-matrix. (A Z-matrix is real square matrix with nonpositive offdiagonal elements.) Included in this class are other matrices such as nonnegative matrices with a strictly dominant diagonal and matrices that are the sum of a Z-matrix having a nonnegative inverse and the tensor product of any two positive vectors in Rn.
Research supported by NSF grants GJ35292 and DCR74-20584
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Chandrasekaran, “A special case of the complementary pivot problem,” Opsearch 7, 1970, 263–268.
R. W. Cottle & R. S. Sacher, “On the solution of large, structured linear complementarity problems: I,” Technical Report 73-4, Department of Operations Research, Stanford University, 1973.
R. W. Cottle, G. H. Golub & R. S. Sacher, “On the solution of large, structured linear complementarity problems: III,” Technical Report 74-439, Computer Science Department, Stanford University, 1974.
R. W. Cottle & G. B. Dantzig, “Complementary pivot theory of mathematical programming,” Linear Algebra and Appl. 1, 1968, 103–125.
C. W. Cryer, “The method of Christopherson for solving free boundary problems for infinite journal bearings by means of finite differences,” Math. Computation 25, 1971, 435–443.
C. W. Cryer, “The solution of a quadratic programming problem using systematic overrelaxation,” SIAM J Control 9, 1971, 385–392.
C. W. Cryer, “Free boundary problems,” forthcoming monograph.
M. Fiedler, & V. Pták, “On matrices with nonpositive off-diagonal elements and positive principal minors,” Czech. J. Math. 12, 1962, 382–400.
O. L. Mangasarian, “Nonlinear programming,” McGraw-Hill, New York, 1969.
O. L. Mangasarian, “Linear complementarity problems solvable by a single linear program,” University of Wisconsin Computer Sciences Technical Report #237, January 1975.
R. Sacher, “On the solution of large, structured linear complementarity problems: II,” Technical Report 73-5, Department of Operations Research, Stanford University, 1973.
R. Saigal, “A note on a special linear complementarity problem,” Opsearch 7, 1970, 175–183.
R. Saigal, “Lemke’s algorithm and a special linear complementarity problem,” Opsearch 8, 1971, 201–208.
A. Tamir, “Minimality and complementarity properties associated with Z-functions and M-functions,” Math. Prog. 7, 1974, 17–31.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag
About this paper
Cite this paper
Mangasarian, O.L. (1976). Solution of linear complementarity problems by linear programming. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0080123
Download citation
DOI: https://doi.org/10.1007/BFb0080123
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07610-0
Online ISBN: 978-3-540-38129-7
eBook Packages: Springer Book Archive
