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

一个双主元单纯形算法及其迭代次数的上界

A double-pivot simplex algorithm and its upper bounds of the iteration numbers

Yaguang Yang

摘要:

本文提出了一种双主元单纯形法。给出了迭代次数的两个上界。将其中一个界应用于一些特殊的线性规划(LP)问题,如具有全幺模矩阵的LP和具有固定折扣率的马尔可夫判定问题(MDP),表明双枢轴单纯形法在强多项式时间内求解这些问题. Klee-Minty立方的一个变体被用来证明迭代次数的估计界是非常紧的。对三种不同的Klee-Minty立方体进行了数值试验,分别求解了$200$约束和$400$变量大小的问题. Dantzig单纯形法不能处理带有$200$约束的Klee-Minty立方体问题,因为它需要大约$2^{200} \approx 10^{60}$迭代。但该算法对所有三种变体都表现得非常好。

英文摘要:

In this paper, a double-pivot simplex method is proposed. Two upper bounds of iteration numbers are derived. Applying one of the bounds to some special linear programming (LP) problems, such as LP with a totally unimodular matrix and Markov Decision Problem (MDP) with a fixed discount rate, indicates that the double-pivot simplex method solves these problems in a strongly polynomial time. A variant of Klee-Minty cube is used to show that the estimated bounds of the iteration numbers are very tight. Numerical test on three variants of Klee-Minty cubes is performed for the problems with sizes as big as $200$ constraints and $400$ variables. Dantzig's simplex method cannot handle Klee-Minty cube problem with $200$ constraints because it needs about $2^{200} \approx 10^{60}$ iterations. But the proposed algorithm performs extremely good for all three variants.

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

↑