Cycling in linear complementarity problems

DOI10.1007/BF01582098MaRDI QIDQ4180163zbMATHFDO

Authors Michael M. Kostreva

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

CyclingLinear Complementarity Problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites work

• scientific article; zbMATH DE number 3332061 (Why is no real title available?)
• Bimatrix Equilibrium Points and Mathematical Programming

Cited in

(6)

• Systematic construction of examples for cycling in the simplex method
• Degeneracy subgraph of the Lemke complementary pivot algorithm and anticycling rule
• Degeneracy in linear complementarity problems: A survey
• Selected bibliography on degeneracy
• Gauss-Newton methods for the complementarity problem
• Some NP-complete problems in linear programming

Describes a project that uses

Uses Software

• Algorithm 431

This page was built for publication: Cycling in linear complementarity problems

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