Sparsity Prevention Pivoting Method for Linear Programming

Sparsity Prevention Pivoting Method for Linear Programming

When the simplex algorithm is used to calculate a linear programming (LP) problem, if the matrix is a sparse matrix, it will be possible to lead to many zero-length calculation steps, and even iterative cycle will appear. To deal with the problem, a new pivoting method is proposed in this paper. The...

Full description

Bibliographic Details
Main Authors: Peiqiang Li, Qiyuan Li, Canbing Li, Bin Zhou, Yijia Cao, Qiuwei Wu, Baling Fang
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Linear programming
pivoting rules
simplex algorithm
sparse matrix
Online Access:https://ieeexplore.ieee.org/document/8320785/

Internet

https://ieeexplore.ieee.org/document/8320785/

Similar Items