Cycling in linear complementarity problems

DOI10.1007/BF01582098zbMATH Open0396.90095MaRDI QIDQ4180163FDOQ4180163

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

• Bimatrix Equilibrium Points and Mathematical Programming
• Title not available (Why is that?)

Cited In (6)

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

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)