A largest-distance pivot rule for the simplex algorithm

DOI10.1016/j.ejor.2007.03.026zbMath1149.90101OpenAlexW2008617921MaRDI QIDQ2463487

Ping-Qi Pan

Publication date: 12 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2007.03.026

zbMATH Keywords

simplex algorithmscalingpivot rulelarge-scale linear programminglargest-distance

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Extreme-point and pivoting methods (90C49)

Related Items (4)

Three nearly scaling-invariant versions of an exterior point algorithm for linear programming ⋮ Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Book review of: P.-Q. Pan, Linear programming computation

Uses Software

• BPMPD
• MINOS
• DEVEX
• NETLIB LP Test Set

Cites Work

• Unnamed Item
• Unnamed Item
• Practical finite pivoting rules for the simplex method
• Steepest-edge simplex algorithms for linear programming
• Computational techniques of the simplex method
• A practicable steepest-edge simplex algorithm
• New Finite Pivoting Rules for the Simplex Method
• Pivot selection methods of the Devex LP code

This page was built for publication: A largest-distance pivot rule for the simplex algorithm