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
B. AVI-ITZHAK, “Heavy traffic characteristics of a circular data network,” Bell System Technical Journal 50 (1971), 2521–2549.
R. W. COTTLE, “Monotone solutions of the parametric linear complementarity problem,” Mathematical Programming 3 (1972), 210–224.
R. W. COTTLE and A. F. VEINOTT, Jr., “Polyhedral sets having a least element,” Mathematical Programming 3 (1972), 238–249.
O. DE DONATO and G. MAIER, “Mathematical programming methods for the inelastic analysis of reinforced concrete frames allowing for limited rotation capacity,” International Journal for Numerical Methods in Engineering 4 (1972), 307–329.
P. HOSCHKA, “Einige Modelle für die Planung des Produktionsprogramms bei konkurrierender Produktion,” Bericht Nr. 272, Deutsche Versuchsanstalt für Luft-und Raumfahrt E.V., Porz-Wahn (Rhld.), September 1963.
I. KANEKO, “A maximization problem related to parametric linear complementarity,” Technical Report 75-1, Department of Operations Research, Stanford University, January 1975.
K. KIRCHGÄSSNER, “Ein Verfahren zur Maximierung linearer Funktionen in nichtkonvexen Bereichen,” Zeitschrift für angewandte Mathematik und Mechanik 42 (1962), T22–T24.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Cottle, R.W. (1975). On Minkowski matrices and the linear complementarity problem. In: Bulirsch, R., Oettli, W., Stoer, J. (eds) Optimization and Optimal Control. Lecture Notes in Mathematics, vol 477. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0079164
Download citation
DOI: https://doi.org/10.1007/BFb0079164
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07393-2
Online ISBN: 978-3-540-37591-3
eBook Packages: Springer Book Archive
