SIMPAR: A parallel sparse simplex

MaRDI QIDQ1900665zbMATH OpenFDO

Authors Yanyan Li

Publication date 1 November 1995

Published in Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

parallel computationparallel sparse simplexrobust simplex algorithmSIMPAR

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Linear programming (90C05)

Review text

The paper is a type of summary report (without precise details) on the implementation of a robust simplex algorithm on a PC enhanced with a ring of 8 transputers (T800). The complicated algorithm does not parallelize efficiently.

Recommendations

• scientific article; zbMATH DE number 125195
• A parallel algorithm for linear programming problems
• Towards a practical parallelisation of the simplex method
• Parallelizing the Dual Simplex Method
• Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

Cited in

(4)

• SIMPAR
• scientific article; zbMATH DE number 125195 (Why is no real title available?)
• Efficient GPU-based implementations of simplex type algorithms
• Towards a practical parallelisation of the simplex method

This page was built for publication: SIMPAR: A parallel sparse simplex

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