On the public citation graph

Solution of linear complementarity problems by linear programming

https://doi.org/10.1007/bfb0080123
0 signed · 28 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01580671openalex-snapshot
Linear complementarity problems solvable by A single linear program
inferredcites →https://doi.org/10.1007/bf01585501openalex-snapshot
Minimality and complementarity properties associated with Z-functions and M-functions
inferredcites →https://doi.org/10.1016/0024-3795(68)90052-9openalex-snapshot
Complementary pivot theory of mathematical programming
inferredcites →https://doi.org/10.1090/s0025-5718-1971-0298961-7openalex-snapshot
The Method of Christopherson for Solving Free Boundary Problems for Infinite Journal Bearings by Means of Finite Differences
inferredcites →https://doi.org/10.1137/0309028openalex-snapshot
The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
inferredcites →https://doi.org/10.1137/1.9781611971255openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.21136/cmj.1962.100526openalex-snapshot
On matrices with non-positive off-diagonal elements and positive principal minors

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_2openalex-snapshot
Complementarity Problems. Origins and Definitions
inferred← citeshttps://doi.org/10.1007/978-1-4757-3141-5_3openalex-snapshot
Complementarity Problems as Mathematical Models
inferred← citeshttps://doi.org/10.1007/bf01582097openalex-snapshot
On a class of least-element complementarity problems
inferred← citeshttps://doi.org/10.1007/bf01584349openalex-snapshot
A note on an open problem in linear complementarity
inferred← citeshttps://doi.org/10.1007/bf02578952openalex-snapshot
L-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program
inferred← citeshttps://doi.org/10.1007/bf02612339openalex-snapshot
Newton's method for linear complementarity problems
inferred← citeshttps://doi.org/10.1007/bfb0120783openalex-snapshot
Characterization of linear complementarity problems as linear programs
inferred← citeshttps://doi.org/10.1007/bfb0120784openalex-snapshot
On solving linear complementarity problems as linear programs
inferred← citeshttps://doi.org/10.1016/0024-3795(78)90077-0openalex-snapshot
On cone orderings and the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0024-3795(79)90103-4openalex-snapshot
Hidden Z-matrices with positive principal minors
inferred← citeshttps://doi.org/10.1016/0024-3795(81)90156-7openalex-snapshot
Matrices and the linear complementarity problem
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90312-jopenalex-snapshot
The equivalence of an LCP to a parametric linear program with a scalar parameter
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50022-7openalex-snapshot
THE IMPLICIT COMPLEMENTARITY PROBLEM11This research was prepared as part of the activities of the Management Sciences Research Group, Carnegie-Mellon University, under Contract N00014-75-C-0621 NR 047-048 with the Office of Naval Research.
inferred← citeshttps://doi.org/10.1016/s0167-6377(96)00034-xopenalex-snapshot
A characterization of an n by 2n
inferred← citeshttps://doi.org/10.1080/02331938208842762openalex-snapshot
Eine Modifizierung des Hauptsatzes der Komplementarität
inferred← citeshttps://doi.org/10.1080/02331938908843492openalex-snapshot
On characterizing linear complementarity problems as linear programs
inferred← citeshttps://doi.org/10.1287/moor.3.2.155openalex-snapshot
A Least-Element Theory of Solving Linear Complementarity Problems as Linear Programs
inferred← citeshttps://doi.org/10.1287/moor.4.3.268openalex-snapshot
Simplified Characterizations of Linear Complementarity Problems Solvable as Linear Programs
inferred← citeshttps://doi.org/10.1287/moor.7.2.272openalex-snapshot
A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem
inferred← citeshttps://doi.org/10.1504/ijsnet.2015.067584openalex-snapshot
A decentralised linear programming approach to energy-efficient event detection
inferred← citeshttps://doi.org/10.33993/jnaat472-1156openalex-snapshot
Linear complementarity problems solvable as linear programs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.