The integer linear complementarity problem
From MaRDI portal
Publication:4009715
DOI10.1080/00207169008803803zbMath0755.90082OpenAlexW2073615434MaRDI QIDQ4009715
Anna Nagurney, Panos M. Pardalos
Publication date: 27 September 1992
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169008803803
Integer programming (90C10) Linear programming (90C05) 2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50)
Related Items (6)
A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems ⋮ Solving discretely constrained mixed complementarity problems using a median function ⋮ Solving binary-constrained mixed complementarity problems using continuous reformulations ⋮ A method for solving the general parametric linear complementarity problem ⋮ Total dual integrality of the linear complementarity problem ⋮ An RLT approach for solving the binary-constrained mixed linear complementarity problem
Cites Work
- Bounds for the solution set of linear complementarity problems
- Indivisible commodities and general equilibrium theory
- Solving Large-Scale Zero-One Linear Programming Problems
- Global Optimization Approach to the Linear Complementarity Problem
- Linear complementarity problems solvable by integer programming
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Probability of a pure equilibrium point in n-person games
- Equilibria of Polymatrix Games
- Integer Programming Algorithms: A Framework and State-of-the-Art Survey
This page was built for publication: The integer linear complementarity problem
