An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

DOI10.1007/BF01585729zbMATH Open0696.90035OpenAlexW2067442388WikidataQ56080060 ScholiaQ56080060MaRDI QIDQ911455FDOQ911455

Authors: N. E. Zubov 

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

Recommendations

• Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
• Practical finite pivoting rules for the simplex method
• What is the worst case behavior of the simplex algorithm?
• New variants of finite criss-cross pivot algorithms for linear programming
• The criss-cross method can take \(\Omega(n^d)\) pivots

zbMATH Keywords

Gray codecriss-cross simplex methodTerlaky's pivoting rule

Mathematics Subject Classification ID

Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• Some Simple Applications of the Travelling Salesman Problem
• New Finite Pivoting Rules for the Simplex Method
• A convergent criss-cross method
• Efficient generation of the binary reflected gray code and its applications
• The Criss-Cross Method for Solving Linear Programming Problems
• Title not available (Why is that?)
• Worst case behavior of the steepest edge simplex method

Cited In (14)

• An efficient simplex type algorithm for sparse and dense linear programs.
• A new proof for the criss-cross method for quadratic programming
• A new family of exponential LP problems
• Criss-cross methods: A fresh view on pivot algorithms
• The role of pivoting in proving some fundamental theorems of linear algebra
• Pivoting rules directing the simplex method through all feasible vertices of Klee-Minty examples
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• Exterior point simplex-type algorithms for linear and network optimization problems
• Steepest-edge rule and its number of simplex iterations for a nondegenerate LP
• Combinatorial redundancy detection
• Pivot rules for linear programming: A survey on recent theoretical developments
• On extremal behaviors of Murty's least index method
• An exterior point simplex algorithm for (general) linear programming problems
• The criss-cross method can take \(\Omega(n^d)\) pivots

This page was built for publication: An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

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