Cycling in linear complementarity problems

DOI10.1007/BF01582098MaRDI QIDQ4180163zbMATH OpenFDO

Authors Michael M. Kostreva

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01582098

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

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

Cited in

(7)

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

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)