Efficient nested pricing in the simplex algorithm

@article{Pan2008EfficientNP,
  title={Efficient nested pricing in the simplex algorithm},
  author={Pingqi Pan},
  journal={Oper. Res. Lett.},
  year={2008},
  volume={36},
  pages={309-313}
}
  • Pingqi Pan
  • Published 2008
  • Mathematics, Computer Science
  • Oper. Res. Lett.
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. 
Dual Pivot Rule
Pivotal Interior-Point Method
Improved Reduced Simplex Method
Dual Simplex Phase-l Method
Geometry of the Feasible Region
Interior-Point Method
Implementation of the Simplex Method
Sensitivity Analysis and Parametric LP
...
1
2
3
4
...

References

SHOWING 1-10 OF 35 REFERENCES
New Finite Pivoting Rules for the Simplex Method
  • R. Bland
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 1977
A largest-distance pivot rule for the simplex algorithm
  • Pingqi Pan
  • Mathematics, Computer Science
  • Eur. J. Oper. Res.
  • 2008
Steepest-edge simplex algorithms for linear programming
A convergent criss-cross method
A practicable steepest-edge simplex algorithm
...
1
2
3
4
...