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

DOI10.1007/S10589-008-9207-4MaRDI QIDQ1029627zbMATH OpenOpenAlexFDO

Authors A. 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

dual simplex algorithmlinear programmingMIP-solver MOPS

Mathematics Subject Classification ID

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

Recommendations

• The dual simplex method, techniques for a fast and stable implementation
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• A generalized dual phase-2 simplex algorithm.
• Hyper-sparsity in the revised simplex method and how to exploit it
• Parallel distributed-memory simplex for large-scale stochastic LP problems

Cites work

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

Cited in

(13)

• The long step rule in the bounded-variable dual simplex method: Numerical experiments
• Parallelizing the dual revised simplex method
• On the sparseness of 1-norm support vector machines
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
• Optimizing MSE for clustering with balanced size constraints
• Novel update techniques for the revised simplex method
• Parallel distributed-memory simplex for large-scale stochastic LP problems
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• Modeling the logistics response to a bioterrorist anthrax attack
• The positive edge pricing rule for the dual simplex
• 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
• Permutations in the Factorization of Simplex Bases

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029627)