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...

Descripció completa

Dades bibliogràfiques

Autors principals:	Peiqiang Li, Qiyuan Li, Canbing Li, Bin Zhou, Yijia Cao, Qiuwei Wu, Baling Fang
Format:	Artigo
Idioma:	Inglês
Publicat:	IEEE 2018-01-01
Col·lecció:	IEEE Access
Matèries:	Linear programming pivoting rules simplex algorithm sparse matrix
Accés en línia:	https://ieeexplore.ieee.org/document/8320785/
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!