Book review of: P.-Q. Pan, Linear programming computation
DOI10.1016/j.ejor.2017.10.051zbMath1403.00016OpenAlexW2767001742MaRDI QIDQ1754296
Lei-Hong Zhang, Yangyang Shi, Wen-Xing Zhu
Publication date: 30 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.10.051
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) External book reviews (00A17) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- Efficient nested pricing in the simplex algorithm
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
- A basis-defiency-allowing variation of the simplex method for linear programming
- A largest-distance pivot rule for the simplex algorithm
- A primal deficient-basis simplex algorithm for linear programming
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Linear Programming Computation
- A Fast Algorithm for Linear Programming
- A Revised Dual Projective Pivot Algorithm for Linear Programming
- On an Efficient Implementation of the Face Algorithm for Linear Programming
This page was built for publication: Book review of: P.-Q. Pan, Linear programming computation
