LINEAR COMPLEMENTARITY AND ORIENTED MATROIDS
From MaRDI portal
Publication:4018360
DOI10.15807/jorsj.35.45zbMath0773.90077OpenAlexW2128226814MaRDI QIDQ4018360
Publication date: 16 January 1993
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.35.45
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
New variants of the criss-cross method for linearly constrained convex quadratic programming, On extremal behaviors of Murty's least index method, Pivoting in linear complementarity: Two polynomial-time cases, Criss-cross methods: A fresh view on pivot algorithms, Combinatorial redundancy detection, Combinatorial characterizations of \(K\)-matrices, EP theorems and linear complementarity problems, Games in oriented matroids, Total dual integrality of the linear complementarity problem, Enumeration of PLCP-orientations of the 4-cube, The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems, On circuit valuation of matroids, A polynomial path-following interior point algorithm for general linear complementarity problems, The linear complementarity problem, sufficient matrices, and the criss- cross method, The finite criss-cross method for hyperbolic programming, EP theorem for dual linear complementarity problems, Pivot rules for linear programming: A survey on recent theoretical developments
