Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
type: Item
instance of: scholarly article
title: Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
zbMATH Open document ID: 1168.90555
author: A. Koberstein
published in: Computational Optimization and Applications
publication date: 2009-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C49
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5577715
zbMATH Keywords: linear programming
zbMATH Keywords: dual simplex algorithm
zbMATH Keywords: MIP-solver MOPS
describes a project that uses: MIPLIB
describes a project that uses: Dsor
describes a project that uses: SoPlex
describes a project that uses: COIN-OR
describes a project that uses: DEVEX
describes a project that uses: BPMPD
describes a project that uses: MOPS
describes a project that uses: NETLIB LP Test Set
MaRDI profile type: Publication
full work available at URL: s10589-008-9207-4
OpenAlex ID: W2001451355
cites work: The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results
cites work: Solving Real-World Linear Programs: A Decade and More of Progress
cites work: Parallelizing the Dual Simplex Method
cites work: MIP: Theory and practice -- closing the gap
cites work: A sparse proximal implementation of the LP dual active set algorithm
cites work: Benchmarking optimization software with performance profiles.
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: The dual active set algorithm and its application to linear programming
cites work: Hyper-sparsity in the revised simplex method and how to exploit it
cites work: Pivot selection methods of the Devex LP code
cites work: Q4187575
cites work: Q3585561
cites work: Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
cites work: The long step rule in the bounded-variable dual simplex method: Numerical experiments
cites work: Q5336851
cites work: Q3840329
cites work: A general phase-I method in linear programming
cites work: A generalized dual phase-2 simplex algorithm.
cites work: Computational techniques of the simplex method
cites work: A dual projective pivot algorithm for linear programming
cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
cites work: A fast LU update for linear programming
cites work: Q4346087
DOI: 10.1007/S10589-008-9207-4
description: scientific article; zbMATH DE number 5577715