Efficient nested pricing in the simplex algorithm

DOI10.1016/J.ORL.2007.10.001MaRDI QIDQ943787zbMATH OpenOpenAlexFDO

Authors 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 ruleDevex rulenested pricingpartial pricingsteepest-edge rule

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• A fast simplex algorithm for linear programming
• A general pricing scheme for the simplex method
• Fresh views on some recent developments in the simplex algorithm
• Practical finite pivoting rules for the simplex method
• A largest-distance pivot rule for the simplex algorithm

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 3202920 (Why is no real title available?)
• scientific article; zbMATH DE number 3206575 (Why is no real title available?)
• A basis-defiency-allowing variation of the simplex method for linear programming
• A convergent criss-cross method
• A practicable steepest-edge simplex algorithm
• A projective simplex algorithm using LU decomposition
• A projective simplex method for linear programming
• Computational techniques of the simplex method
• New Finite Pivoting Rules for the Simplex Method
• Numerical Optimization
• Optimality and Degeneracy in Linear Programming
• Partial pricing rule simplex method with deficient basis
• Pivot rules for linear programming: A survey on recent theoretical developments
• Pivot selection methods of the Devex LP code
• Practical finite pivoting rules for the simplex method
• Solving Real-World Linear Programs: A Decade and More of Progress
• Steepest-edge simplex algorithms for linear programming
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• The generalized simplex method for minimizing a linear form under linear inequality restraints

Cited in

(8)

• A new local dimming algorithm based on the simplex method
• Implementing the simplex method as a cutting-plane method, with a view to regularization
• Fresh views on some recent developments in the simplex algorithm
• A regularized simplex method
• A general pricing scheme for the simplex method
• A fast simplex algorithm for linear programming
• Three nearly scaling-invariant versions of an exterior point algorithm for linear programming
• Book review of: P.-Q. Pan, Linear programming computation

Describes a project that uses

Uses Software

• MINOS
• DEVEX

This page was built for publication: Efficient nested pricing in the simplex algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943787)