Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
From MaRDI portal
Publication:2642636
Recommendations
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- The dual simplex method, techniques for a fast and stable implementation
- A generalized dual phase-2 simplex algorithm.
- A primal-dual simplex method for linear programs
- Investigating phase 1 of the dual simplex
Cites work
- A fast LU update for linear programming
- A generalized dual phase-2 simplex algorithm.
- A piecewise linear dual phase-1 algorithm for the simplex method
- A practical anti-cycling procedure for linearly constrained optimization
- Advanced preprocessing techniques for linear and quadratic programming
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Benchmarking optimization software with performance profiles.
- Computational techniques of the simplex method
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- scientific article; zbMATH DE number 1187125 (Why is no real title available?)
- scientific article; zbMATH DE number 3625109 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 3209723 (Why is no real title available?)
- Linear optimization and extensions
- MOPS -- Mathematical optimization system
- Parallelizing the Dual Simplex Method
- Pivot selection methods of the Devex LP code
- Practical finite pivoting rules for the simplex method
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
- Solving Real-World Linear Programs: A Decade and More of Progress
- Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
- Steepest-edge simplex algorithms for linear programming
- The Composite Simplex Algorithm
- The long step rule in the bounded-variable dual simplex method: Numerical experiments
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
Cited in
(12)- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- The long step rule in the bounded-variable dual simplex method: Numerical experiments
- Book review of: P.-Q. Pan, Linear programming computation
- A generalized dual phase-2 simplex algorithm.
- Strong duality and minimal representations for cone optimization
- Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
- The dual simplex method, techniques for a fast and stable implementation
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- On simplex method with most-obtuse-angle rule and cosine rule
- MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
- Computational study of the GDPO dual phase-1 algorithm
This page was built for publication: Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642636)
