arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.11451math.OC
收藏

一种用于线性规划的双主元退化鲁棒单纯形算法

A double-pivot degenerate-robust simplex algorithm for linear programming

Yaguang Yang, Fabio Vitor

AI总结:

本文提出一种结合双主元策略的退化鲁棒单纯形算法,通过多类LP测试表明其能容忍退化,并在大规模随机问题上比Dantzig算法更高效。

摘要:

本文提出了一种双主元算法,该算法结合了作者近期发表的两篇论文中的特点。所提算法在MATLAB中实现。该MATLAB代码与Dantzig算法的MATLAB实现一起,在多个测试集上进行了测试,包括一组循环LP问题、Klee-Minty问题、随机生成的线性规划(LP)问题以及Netlib基准问题。测试结果表明,所提算法(a)如预期具有退化容忍性,(b)对于大规模随机生成的LP问题,在CPU时间方面比Dantzig算法更高效,但对于Netlib基准问题和小规模随机生成问题则效率较低。

英文摘要:

A double pivot algorithm that combines features of two recently published papers by these authors is proposed. The proposed algorithm is implemented in MATLAB. The MATLAB code is tested, along with a MATLAB implementation of Dantzig's algorithm, for several test sets, including a set of cycling LP problems, Klee-Minty's problems, randomly generated linear programming (LP) problems, and Netlib benchmark problems. The test result shows that the proposed algorithm is (a) degenerate-tolerance as we expected, and (b) more efficient than Dantzig's algorithm for large size randomly generated LP problems but less efficient for Netlib benchmark problems and small size randomly generated problems in terms of CPU time.

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

↑