View Item 

Show simple item record

A class of polynomially solvable linear complementarity problems

dc.contributor.authorChu, Teresa H.en_US
dc.date.accessioned2006-09-11T19:32:05Z
dc.date.available2006-09-11T19:32:05Z
dc.date.issued2006-07en_US
dc.identifier.citationChu, Teresa H.; (2006). "A class of polynomially solvable linear complementarity problems." Mathematical Programming 107(3): 461-470. <http://hdl.handle.net/2027.42/47904>en_US
dc.identifier.issn1436-4646en_US
dc.identifier.issn0025-5610en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/47904
dc.description.abstractAlthough the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the defining matrix is nondegenerate and for which the n -step property holds. In this paper we consider an extension of the property to the degenerate case by introducing the concept of an extended n -step vector and matrix. It is shown that the LCP defined by such a matrix is polynomially solvable as well.en_US
dc.format.extent179724 bytes
dc.format.extent3115 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherSpringer-Verlag; Springer-Verlag Berlin Heidelbergen_US
dc.subject.otherCombinatoricsen_US
dc.subject.otherCalculus of Variations and Optimal Controlen_US
dc.subject.otherOptimizationen_US
dc.subject.otherNumerical Analysisen_US
dc.subject.otherMathematicsen_US
dc.subject.otherMathematical and Computational Physicsen_US
dc.subject.otherMathematics of Computingen_US
dc.subject.otherMathematical Methods in Physicsen_US
dc.titleA class of polynomially solvable linear complementarity problemsen_US
dc.typeArticleen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDept. of Ind. & Oper. Eng, , University of Michigan, , Ann Arbor, MI, 48109, USAen_US
dc.contributor.affiliationumcampusAnn Arboren_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/47904/1/10107_2005_Article_671.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1007/s10107-005-0671-7en_US
dc.identifier.sourceMathematical Programmingen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10107_2005_Article_671.pdf
Size:
175.5KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information 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.