Efficient nested pricing in the simplex algorithm

Authors:
Ping-Qi Pan
Affiliations:
Department of Mathematics, Southeast University, Nanjing, 210096, People's Republic of China
Venue:
Operations Research Letters
Year:
2008

Citing 2
Cited 1

Steepest-edge simplex algorithms for linear programming

Mathematical Programming: Series A and B
Solving Real-World Linear Programs: A Decade and More of Progress

Operations Research

Implementing the simplex method as a cutting-plane method, with a view to regularization

Computational Optimization and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report a remarkable success of nested pricing rules over major pivot rules commonly used in practice, such as Dantzig's original rule as well as the steepest-edge rule and Devex rule.