A generalized complementary pivoting algorithm

DOI10.1007/BF01580244zbMath0285.90053OpenAlexW1995397633MaRDI QIDQ4772970

Michael J. Todd

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (9)

Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm ⋮ Tropical Complementarity Problems and Nash Equilibria ⋮ The maximum diameter of pure simplicial complexes and pseudo-manifolds ⋮ Exponentiality of the exchange algorithm for finding another room-partitioning ⋮ A combinatorial generalization of polytopes ⋮ Characterizing binary simplicial matroids ⋮ Cubical Sperner lemmas as applications of generalized complementary pivoting ⋮ The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix ⋮ Oriented Euler complexes and signed perfect matchings

Cites Work

• Equilibrium Points of Bimatrix Games
• Bimatrix Equilibrium Points and Mathematical Programming
• A generalization of the linear complementarity problem
• Computing Kakutani Fixed Points
• Homotopies for computation of fixed points on unbounded regions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalized complementary pivoting algorithm