๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Linear complementarity problems solvable by A single linear program

โœ Scribed by O. L. Mangasarian

Publisher
Springer-Verlag
Year
1976
Tongue
English
Weight
360 KB
Volume
10
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Sign-solvable linear complementarity pro
Sign-solvable linear complementarity problems
โœ Naonori Kakimura ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 143 KB

This paper presents a connection between qualitative matrix theory and linear complementarity problems (LCPs). An LCP is said to be sign-solvable if the set of the sign patterns of the solutions is uniquely determined by the sign patterns of the given coefficients. We provide a characterization for