Adjacent vertex simplex algorithms: More experimental results on random problems

DOI10.1016/0305-0548(94)90102-3zbMath0799.90082OpenAlexW1975251632MaRDI QIDQ1321806

William Hurley

Publication date: 17 November 1994

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)90102-3

zbMATH Keywords

interior point methodsadjacent vertex simplex algorithms

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Uses Software

• DEVEX

Cites Work

• A new polynomial-time algorithm for linear programming
• Nonadjacent extreme point methods for solving linear programs
• A decision rule for improved efficiency in solving linear programming problems with the simplex algorithm
• A practicable steepest-edge simplex algorithm
• Pivot selection methods of the Devex LP code
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adjacent vertex simplex algorithms: More experimental results on random problems