Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation

DOI10.1007/s10589-008-9207-4zbMath1168.90555OpenAlexW2001451355MaRDI QIDQ1029627

Achim Koberstein

Publication date: 13 July 2009

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

Full work available at URL: https://doi.org/10.1007/s10589-008-9207-4

zbMATH Keywords

linear programmingdual simplex algorithmMIP-solver MOPS

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (10)

Modeling the logistics response to a bioterrorist anthrax attack ⋮ Parallelizing the dual revised simplex method ⋮ The positive edge pricing rule for the dual simplex ⋮ Parallel distributed-memory simplex for large-scale stochastic LP problems ⋮ Implementing the simplex method as a cutting-plane method, with a view to regularization ⋮ Permutations in the Factorization of Simplex Bases ⋮ Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts ⋮ On the sparseness of 1-norm support vector machines ⋮ Optimizing MSE for clustering with balanced size constraints ⋮ Novel update techniques for the revised simplex method

Uses Software

• BPMPD
• SoPlex
• MIPLIB
• COIN-OR
• DEVEX
• MOPS
• Dsor
• NETLIB LP Test Set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general phase-I method in linear programming
• A practical anti-cycling procedure for linearly constrained optimization
• A fast LU update for linear programming
• The long step rule in the bounded-variable dual simplex method: Numerical experiments
• A dual projective pivot algorithm for linear programming
• Steepest-edge simplex algorithms for linear programming
• A generalized dual phase-2 simplex algorithm.
• Computational techniques of the simplex method
• A sparse proximal implementation of the LP dual active set algorithm
• Hyper-sparsity in the revised simplex method and how to exploit it
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• 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
• The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
• Parallelizing the Dual Simplex Method
• Pivot selection methods of the Devex LP code
• Benchmarking optimization software with performance profiles.
• The dual active set algorithm and its application to linear programming

This page was built for publication: Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation