Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules

DOI10.1080/02331934.2013.811666zbMath1293.90038OpenAlexW2013543911MaRDI QIDQ5413871

Adrienn Nagy, Tibor Illés

Publication date: 2 May 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2013.811666

zbMATH Keywords

linear programmingprimal simplex methodindex selection rulesmonotonic build-up simplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (4)

A corrector-predictor interior-point method with new search direction for linear optimization ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems ⋮ Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied

Cites Work

• Pivot rules for linear programming: A survey on recent theoretical developments
• New variants of the criss-cross method for linearly constrained convex quadratic programming
• The \(s\)-monotone index selection rules for pivot algorithms of linear programming
• The role of pivoting in proving some fundamental theorems of linear algebra
• Assembly-Line Balancing by Linear Programming
• A Monotonic Build-Up Simplex Algorithm for Linear Programming
• Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization

This page was built for publication: Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules