.png){kind=icon}
.png){kind=icon}
Return
Efficient GPU-based implementations of simplex type algorithms
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2014.10.096.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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, Meszaros) are also presented. The results show that the proposed GPU implementations outperform MATLAB's interior point method. (C) 2014 Elsevier Inc. All rights reserved.
Keywords:
Linear Programming
Simplex type algorithms
Graphical Processing Unit
Parallel Computing
MATLAB
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
2.3W
Citations:
3.3W