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

Бүрэн тодорхойлолт

Номзүйн дэлгэрэнгүй

Үндсэн зохиолчид:	Peiqiang Li, Qiyuan Li, Canbing Li, Bin Zhou, Yijia Cao, Qiuwei Wu, Baling Fang
Формат:	Artigo
Хэл сонгох:	Inglês
Хэвлэсэн:	IEEE 2018-01-01
Цуврал:	IEEE Access
Нөхцлүүд:	Linear programming pivoting rules simplex algorithm sparse matrix
Онлайн хандалт:	https://ieeexplore.ieee.org/document/8320785/
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!