返回
Sparsity Prevention Pivoting Method for Linear Programming
DOI:10.1109/ACCESS.2018.2817571.png)
摘要
En 中文
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 principle of this method is to avoid choosing the row which the value of the element in the right side of constraint expression for LP in this row is zero as the row of the pivot element to make the matrix in LP density and ensure that most subsequent steps will improve the value of the objective function. One step following this principle is inserted in the existing LP algorithm to reselect the pivot element. Both the conditions for inserting this step and the maximum number of allowed insertion steps are determined. In the case study, taking several numbers of LP problems as examples, the results indicate that this method can effectively improve the efficiency of LP for the sparse matrix.
Keyword:
Linear programming
pivoting rules
simplex algorithm
sparse matrix
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
A mixed integer linear programming approach for optimal DER portfolio, sizing, and placement in multi-energy microgrids一种混合整数线性规划方法,用于多能源微电网中的最佳DER组合,大小和位置
APPLIED ENERGY
IF11
Physical characteristics and utilization of ZSM-5 prepared from rice husk silica and aluminum hydroxide as catalyst for transesterification of Ricinus communis oil以稻壳硅和氢氧化铝制备的ZSM-5的物理特性及其作为蓖麻油酯交换催化剂的应用

