arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.08468math.OC
收藏

关于线性规划的面pivot单纯形方法

On the facet pivot simplex method for linear programming

Goddard Space Flight Center, NASA(戈达德太空飞行中心,美国国家航空航天局)

Yaguang Yang

AI总结:

本文提出了一种面pivot单纯形方法,并通过数值测试证明其比顶点pivot方法更具潜力,希望为寻找线性规划的多项式pivot单纯形方法提供希望。

摘要:

Dantzig的顶点pivot单纯形方法已发表超过七十年。令人惊讶的是,尽管经过许多努力寻找更好的方法,它仍然是解决线性规划(LP)问题最有效的方法之一。在本文中,我们提出了一种面pivot单纯形方法,并通过数值测试证明新方法比顶点pivot方法更具前景。由于多年来没有找到线性规划问题的多项式pivot单纯形算法,我们希望这种新的pivot算法能为我们找到线性规划问题的多项式pivot单纯形方法带来希望。面pivot算法的Matlab实现和Netlib基准测试问题可在Matlab文件交换网站上获得。

英文摘要:

Dantzig's vertex pivot simplex method has been published for more than seven decades. Amazingly, it remains one of the most efficient methods to solve linear programming (LP) problem after numerous efforts trying to find some better methods. In this paper, we propose a facet pivot simplex method and demonstrate by numerical testing that the new method is very promising compared to the vertex pivot method. Since there is no polynomial pivot simplex algorithm for linear programming problems after many decades of effort, we hope that this new type of pivot algorithm will give us some hope to find a polynomial pivot simplex method for linear programming problems. A Matlab implementation of the facet pivot algorithm and Netlib benchmark test problems are available in Matlab file exchange website.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑