Efficient GPU-based implementations of simplex type algorithms

•We propose two efficient GPU-based implementations of simplex type algorithms.•We computationally compare our GPU-based implementations with MATLAB’s solver.•A maximum speedup of 181 is reported for the Exterior Point Simplex Algorithm on randomly generated LPs.•A maximum speedup of 58 is reported...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Applied mathematics and computation Jg. 250; S. 552 - 570
Hauptverfasser: Ploskas, Nikolaos, Samaras, Nikolaos
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.01.2015
Schlagworte:
Algorithms
Benchmarking
Computation
Exteriors
Graphical Processing Unit
Hardware
Linear Programming
MATLAB
Optimization
Parallel Computing
Simplex type algorithms
Graphical Processing Unit
Simplex type algorithms
MATLAB
Parallel Computing
Linear Programming
ISSN:0096-3003, 1873-5649
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We propose two efficient GPU-based implementations of simplex type algorithms.•We computationally compare our GPU-based implementations with MATLAB’s solver.•A maximum speedup of 181 is reported for the Exterior Point Simplex Algorithm on randomly generated LPs.•A maximum speedup of 58 is reported for the Revised Simplex Algorithm on randomly generated LPs.•An average speedup of 2.30 is reported for the primal–dual exterior point algorithm on benchmark LPs. Recent hardware advances have made it possible to solve large scale Linear Programming problems in a short amount of time. Graphical Processing Units (GPUs) have gained a lot of popularity and have been applied to linear programming algorithms. In this paper, we propose two efficient GPU-based implementations of the Revised Simplex Algorithm and a Primal–Dual Exterior Point Simplex Algorithm. Both parallel algorithms have been implemented in MATLAB using MATLAB’s Parallel Computing Toolbox. Computational results on randomly generated optimal sparse and dense linear programming problems and on a set of benchmark problems (netlib, kennington, Mészáros) are also presented. The results show that the proposed GPU implementations outperform MATLAB’s interior point method.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2014.10.096