Integer solution for linear complementarity problem

DOI10.1287/MOOR.23.2.390MaRDI QIDQ2757540zbMATH OpenOpenAlexFDO

Authors R. Chandrasekaran, Santosh N. Kabadi, R. Sridhar

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

zbMATH Keywords

linear complementarityprincipal unimodularitytotal unimodularity convex quadratic program peeling algorithm

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) 2-person games (91A05)

Recommendations

• The integer linear complementarity problem
• Linear complementarity problems solvable by integer programming
• Integral solutions of linear complementarity problems
• A complete and terminating approach to linear integer solving
• An Integer Programming Problem with a Linear Programming Solution
• On integer solutions to linear equations
• scientific article; zbMATH DE number 53115
• scientific article; zbMATH DE number 653034
• Linear complementarity problems with an invariant number of solutions
• scientific article; zbMATH DE number 4135714

Cited in

(15)

• Solving discretely constrained mixed complementarity problems using a median function
• Total dual integrality of the linear complementarity problem
• Total dual integrality and integral solutions of the linear complementarity problem
• On pseudomatroid property of matrices
• An RLT approach for solving the binary-constrained mixed linear complementarity problem
• A complete and terminating approach to linear integer solving
• Computing integral solutions of complementarity problems
• A method for solving the general parametric linear complementarity problem
• Solving binary-constrained mixed complementarity problems using continuous reformulations
• Integral solutions of linear complementarity problems
• The Linear Complementarity Problems with a Few Variables per Constraint
• The integer linear complementarity problem
• A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
• Two class of synchronous matrix multisplitting schemes for solving linear complementarity problems
• Nonnegative partial s-goodness for the equivalence of a 0-1 linear program to weighted linear programming

This page was built for publication: Integer solution for linear complementarity problem

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