A note on the Edmonds-Fukuda pivoting rule for simplex algorithms

DOI10.1016/0377-2217(87)90251-7zbMath0631.90040OpenAlexW2062191943MaRDI QIDQ1095028

Jens Clausen

Publication date: 1987

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(87)90251-7

zbMATH Keywords

cyclingsimplex algorithmspivot rule of Edmonds-Fukudastalling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (4)

Criss-cross methods: A fresh view on pivot algorithms ⋮ Pivot rules for linear programming: A survey on recent theoretical developments ⋮ An exterior point simplex algorithm for (general) linear programming problems ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• A new polynomial-time algorithm for linear programming
• New Finite Pivoting Rules for the Simplex Method
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the Edmonds-Fukuda pivoting rule for simplex algorithms