Abstract
Motivated by a number of typical applications, a generalization of the classicallinear complementarity problem is presented together with an algorithm to determine the complete solution set. The algorithm is based on the double description method for solving linear inequalities and succeeds in describing continuous as well as unbounded solution sets.
Similar content being viewed by others
References
F. Al-Khayyal, “An implicit enumeration procedure for the general linear complementarity problem,”Mathematical Programming Study 31 (1987) 1–20.
R.W. Cottle and G.B. Dantzig, “Complementary pivot theory of mathematical programming,”Linear Algebra and its Applications 1 (1968) 103–125.
R.W. Cottle and G.B. Dantzig, “A generalization of the linear complementarity problem,”Journal of Combinatorial Theory 8 (1970) 79–90.
R.W. Cottle, F. Giannessi and J.-L. Lions, eds.,Variational Inequalities and Complementarity Problems (Wiley, New York, 1980).
B. De Moor and J. Vandewalle, “All nonnegative solutions of sets of linear equations and the LCP,”Proceedings of the International Symposium on Circuits and Systems (1987) pp. 1072–1079.
B. De Moor, “Mathematical concepts and techniques for modelling of static and dynamic systems,” Doctoral dissertation, Department of Electrical Engineering, Katholieke Universiteit Leuven (Leuven, Belgium, 1988).
B.C. Eaves and C.E. Lemke, “Equivalence of LCP and PLS,”Mathematics of Operations Research 6 (1981) 475–484.
B.C. Eaves, “Linear complementarity and piecewise linear equations,” in: B.C. Eaves, F.J. Gould, H.-O. Peitgen and M.J. Todd, eds.,Homotopy Methods and Global Convergence (Plenum Press, New York, 1983) pp. 79–90.
C.E. Lemke, “Bimatrix equilibrium points and mathematical programming,”Management Science 11 (1965) 681–689.
T.H. Matheiss and D.S. Rubin, “A survey and comparison of methods for finding all vertices of convex polyhedral sets,”Mathematics of Operation Research 5 (1980) pp. 167–185.
T.S. Motzkin, H. Raiffa, G.L. Thompson and R.M. Thrall, “The double description method,” in: H.W. Kuhn, A.W. Tucker, eds.,Contributions to the Theory of Games, Annals of Mathematics Studies No. 28 (Princeton University Press, Princeton, NJ, 1953) pp. 51–73.
K.G. Murty,Linear Complementarity, Linear and Nonlinear Programming. Sigma Series in Applied Mathematics (Heldermann, Berlin, 1988).
C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization, Algorithms and Complexity (Prentice-Hall, Englewood Cliffs, NJ, 1982).
S.N. Stevens and P.-M. Lin, “Analysis of piecewise-linear resistive networks using complementary pivot theory,”IEEE Transactions on Circuits and Systems CAS-28 (1981) 429–441.
S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, “A new algorithm for generating all maximal independent sets,”SIAM Journal on Computing 6 (1977) 505–517.
W.M.G. van Bokhoven,Piecewise-linear Modelling and Analysis (Kluwer, Deventer, 1980).
L. Vandenberghe, B. De Moor and J. Vandewalle, “The generalized linear complementarity problem applied to the complete analysis of resistive piecewise linear circuits,”IEEE Transactions on Circuits and Systems 36 (1989) 1382–1391.
Author information
Authors and Affiliations
Additional information
Dr. De Moor is Research Associate and L. Vandenberghe is Research Assistant of the Belgian National Fund for Scientific Research (NFWO). The results presented in this paper have been obtained within the framework of the Belgian Program on Concerted Research Actions and on the Interuniversity Attraction Poles initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The scientific responsibility rests with the authors.
Rights and permissions
About this article
Cite this article
De Moor, B., Vandenberghe, L. & Vandewalle, J. The generalized linear complementarity problem and an algorithm to find all its solutions. Mathematical Programming 57, 415–426 (1992). https://doi.org/10.1007/BF01581091
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581091