Linear complementarity problems solvable by integer programming

DOI10.1080/02331938808843365zbMath0652.90095OpenAlexW2081744193MaRDI QIDQ3798493

Panos M. Pardalos

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843365

zbMATH Keywords

linear complementaritymixed zero-one integer programmingmultiple- cost-row program

Mathematics Subject Classification ID

Mixed integer programming (90C11) Quadratic programming (90C20) Linear programming (90C05) Numerical methods based on nonlinear programming (49M37) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Boolean programming (90C09)

Related Items

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, Affinely Adjustable Robust Linear Complementarity Problems, On equivalent reformulations for absolute value equations, The integer linear complementarity problem, A mixed integer programming approach to the tensor complementarity problem, An algorithm for computing all solutions of an absolute value equation, Tensor complementarity problems. II: Solution methods, Checking solvability of systems of interval linear equations and inequalities via mixed integer programming, On the equivalence of linear complementarity problems

Uses Software

• LINDO
• MINOS

Cites Work

• Valid inequalities for mixed 0-1 programs
• Bounds for the solution set of linear complementarity problems
• On the number of solutions to the complementarity problem and spanning properties of complementary cones
• Solving Large-Scale Zero-One Linear Programming Problems
• Global Optimization Approach to the Linear Complementarity Problem
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey