Observations on a class of nasty linear complementarity problems

DOI10.1016/0166-218X(80)90001-3zbMath0436.90107MaRDI QIDQ1141086

Richard W. Cottle

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear complementarity problemsGray codebasic sequencesbinary n-vectorsHamiltonian paths on n-cubes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Paths and cycles (05C38)

Related Items

Some LCPs solvable in strongly polynomial time with Lemke's algorithm, On the number of iterations of local improvement algorithms, Minimal triangulation of the 4-cube, Measuring conformability of probabilities, Low order polynomial bounds on the expected performance of local improvement algorithms, On the computational complexity of piecewise-linear homotopy algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of complementary pivot methods
• Digraph Models of Bard-Type Algorithms for the Linear Complementarity Problem
• Bimatrix Equilibrium Points and Mathematical Programming
• Affine m-ary gray codes
• A Partition Theorem for Euclidean n-Space