Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Sign-Solvable Linear Complementarity Problems

From MaRDI portal
Publication:5429282
Jump to:navigation, search

DOI10.1007/978-3-540-72792-7_30zbMATH Open1136.90486OpenAlexW1532095519MaRDI QIDQ5429282FDOQ5429282


Authors: Naonori Kakimura Edit this on Wikidata


Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_30




Recommendations

  • Sign-solvable linear complementarity problems
  • Solving linear programs from sign patterns
  • Signsolvability revisited
  • Sparse Linear Complementarity Problems
  • A polynomial-time algorithm for a class of linear complementarity problems


zbMATH Keywords

Linear Complementarity ProblemsCombinatorial Matrix Theory


Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)



Cited In (3)

  • Signsolvability revisited
  • Solving linear programs from sign patterns
  • Sign-solvable linear complementarity problems





This page was built for publication: Sign-Solvable Linear Complementarity Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5429282)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5429282&oldid=20182991"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 9 February 2024, at 02:45. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki