Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples

zbMath0674.90063MaRDI QIDQ1121785

Konstantinos Paparrizos

Publication date: 1989

Published in: Opsearch (Search for Journal in Brave)

zbMATH Keywords

simplex methodspeed of convergencepivoting rulesExponentialityKlee-Minty's examples

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

Criss-cross methods: A fresh view on pivot algorithms, Resolution of the problem of degeneracy in a primal and dual simplex algorithm, A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra, An efficient simplex type algorithm for sparse and dense linear programs., Pivot rules for linear programming: A survey on recent theoretical developments, An exterior point simplex algorithm for (general) linear programming problems