Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms

DOI10.1007/s10589-007-9022-3zbMath1161.90438OpenAlexW1969179485MaRDI QIDQ2642636

Achim Koberstein, Uwe H. Suhl

Publication date: 17 August 2007

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-007-9022-3

zbMATH Keywords

Linear programmingDual simplex algorithmMathematical optimization system (MOPS)

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06)

Related Items

Implementing the simplex method as a cutting-plane method, with a view to regularization, Strong duality and minimal representations for cone optimization, Book review of: P.-Q. Pan, Linear programming computation, Computational study of the GDPO dual phase-1 algorithm, On simplex method with most-obtuse-angle rule and cosine rule, Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts, Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation

Uses Software

• BPMPD
• SoPlex
• MIPLIB
• CPLEX
• DEVEX
• MOPS
• Dsor
• NETLIB LP Test Set

Cites Work

• Practical finite pivoting rules for the simplex method
• A practical anti-cycling procedure for linearly constrained optimization
• The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study
• A fast LU update for linear programming
• MOPS -- Mathematical optimization system
• The long step rule in the bounded-variable dual simplex method: Numerical experiments
• A piecewise linear dual phase-1 algorithm for the simplex method
• Advanced preprocessing techniques for linear and quadratic programming
• Steepest-edge simplex algorithms for linear programming
• A generalized dual phase-2 simplex algorithm.
• Computational techniques of the simplex method
• Linear optimization and extensions
• Solving Real-World Linear Programs: A Decade and More of Progress
• Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
• Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
• Parallelizing the Dual Simplex Method
• The Composite Simplex Algorithm
• Pivot selection methods of the Devex LP code
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item