Efficient nested pricing in the simplex algorithm

DOI10.1016/j.orl.2007.10.001zbMath1159.90455MaRDI QIDQ943787

Ping-Qi Pan

Publication date: 10 September 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.10.001

zbMATH Keywords

Dantzig's rule; Devex rule; nested pricing; partial pricing; steepest-edge rule

Mathematics Subject Classification ID

90C05: Linear programming

Uses Software

• MINOS
• DEVEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Practical finite pivoting rules for the simplex method
• A projective simplex method for linear programming
• Pivot rules for linear programming: A survey on recent theoretical developments
• Steepest-edge simplex algorithms for linear programming
• A basis-defiency-allowing variation of the simplex method for linear programming
• Computational techniques of the simplex method
• A projective simplex algorithm using LU decomposition
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Solving Real-World Linear Programs: A Decade and More of Progress
• A convergent criss-cross method
• A practicable steepest-edge simplex algorithm
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• New Finite Pivoting Rules for the Simplex Method
• Numerical Optimization
• Pivot selection methods of the Devex LP code
• Optimality and Degeneracy in Linear Programming