A finite characterization of K -matrices in dimensions less than four
dc.contributor.author | Fredricksen, John T. | en_US |
dc.contributor.author | Watson, Layne Terry | en_US |
dc.contributor.author | Murty, Katta G. | en_US |
dc.date.accessioned | 2006-09-11T19:32:42Z | |
dc.date.available | 2006-09-11T19:32:42Z | |
dc.date.issued | 1986-05 | en_US |
dc.identifier.citation | Fredricksen, John T.; Watson, Layne T.; Murty, Katta G.; (1986). "A finite characterization of K -matrices in dimensions less than four." Mathematical Programming 35(1): 17-31. <http://hdl.handle.net/2027.42/47913> | en_US |
dc.identifier.issn | 0025-5610 | en_US |
dc.identifier.issn | 1436-4646 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/47913 | |
dc.description.abstract | The class of real n × n matrices M , known as K -matrices, for which the linear complementarity problem w − Mz = q, w ≥ 0, z ≥ 0, w T z =0 has a solution whenever w − Mz =q, w ≥ 0, z ≥ 0 has a solution is characterized for dimensions n <4. The characterization is finite and ‘practical’. Several necessary conditions, sufficient conditions, and counterexamples pertaining to K -matrices are also given. A finite characterization of completely K -matrices ( K -matrices all of whose principal submatrices are also K -matrices) is proved for dimensions <4. | en_US |
dc.format.extent | 727086 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Springer-Verlag; The Mathematical Programming Society, Inc. | en_US |
dc.subject.other | K -Matrix | en_US |
dc.subject.other | Finite Characterization | en_US |
dc.subject.other | Q 0 -Matrix | en_US |
dc.subject.other | Mathematical and Computational Physics | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Q -Matrix | en_US |
dc.subject.other | Numerical Analysis | en_US |
dc.subject.other | Mathematics of Computing | en_US |
dc.subject.other | Combinatorics | en_US |
dc.subject.other | Calculus of Variations and Optimal Control | en_US |
dc.subject.other | Linear Complementarity Problem | en_US |
dc.subject.other | Numerical and Computational Methods | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Mathematical Methods in Physics | en_US |
dc.title | A finite characterization of K -matrices in dimensions less than four | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Industrial and Operations Engineering, University of Michigan, 48109, Ann Arbor, MI, USA | en_US |
dc.contributor.affiliationother | Department of Computer Science, Virginia Polytechnic Institute and State University, 24061, Blacksburg, VA, USA | en_US |
dc.contributor.affiliationother | Amdahl Corporation, 1250 East Arques Avenue, 94088-3470, Sunnyvale, CA, USA | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/47913/1/10107_2005_Article_BF01589438.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1007/BF01589438 | en_US |
dc.identifier.source | Mathematical Programming | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.