.png){kind=icon}
返回
GPU accelerated pivoting rules for the simplex algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2014.04.047.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Simplex type algorithms perform successive pivoting operations (or iterations) in order to reach the optimal solution. The choice of the pivot element at each iteration is one of the most critical step in simplex type algorithms. The flexibility of the entering and leaving variable selection allows to develop various pivoting rules. In this paper, we have proposed some of the most well-known pivoting rules for the revised simplex algorithm on a CPU-GPU computing environment. All pivoting rules have been implemented in MATLAB and CUDA. Computational results on randomly generated optimal dense linear programs and on a set of benchmark problems (Netlib-optimal, Kennington, Netlib-infeasible, Meszaros) are also presented. These results showed that the proposed GPU implementations of the pivoting rules outperform the corresponding CPU implementations. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Linear programming
Simplex algorithm
Pivoting rules
Graphical Processing Unit
MATLAB
Compute Unified Device Architecture
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
引用论文
Optimization of the biotransformation fermentation medium of dihydroartemisinin二氢青蒿素生物转化发酵培养基的优化.png)
IF0
PREAI
分享收藏
分享收藏
查看更多内容