Integer Solution for Linear Complementarity Problem
From MaRDI portal
Publication:2757540
DOI10.1287/moor.23.2.390zbMath0977.90057OpenAlexW2038602326MaRDI QIDQ2757540
No author found.
Publication date: 26 November 2001
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.23.2.390
linear complementarityprincipal unimodularitytotal unimodularity convex quadratic program peeling algorithm
2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, Solving discretely constrained mixed complementarity problems using a median function, The Linear Complementarity Problems with a Few Variables per Constraint, Solving binary-constrained mixed complementarity problems using continuous reformulations, Computing integral solutions of complementarity problems, Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming, A method for solving the general parametric linear complementarity problem, On pseudomatroid property of matrices, Total dual integrality of the linear complementarity problem, An RLT approach for solving the binary-constrained mixed linear complementarity problem, Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems, Total dual integrality and integral solutions of the linear complementarity problem
