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

On monotonicity in parametric linear complementarity problems

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

DOI10.1007/BF01593769zbMATH Open0367.90106MaRDI QIDQ4145442FDOQ4145442


Authors: Nimrod Megiddo Edit this on Wikidata


Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)






Mathematics Subject Classification ID

Linear programming (90C05) Nonlinear programming (90C30)


Cites Work

  • The complementarity problem
  • Monotone solutions of the parametric linear complementarity problem
  • A Partition Theorem for Euclidean n-Space
  • Polyhedral sets having a least element
  • Title not available (Why is that?)


Cited In (4)

  • Solutions of parametric complementarity problems monotone with respect to parameters
  • Isotone solutions of parametric linear complementarity problems
  • Theoretical and algorithmic advances in multi-parametric programming and control
  • A method for solving the general parametric linear complementarity problem





This page was built for publication: On monotonicity in parametric linear complementarity problems

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

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