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

线性和非线性规划的增广算法:从Edmonds-Karp到Bland及以后

On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond

Jesus A. De Loera, Raymond Hemmecke, Jon Lee

摘要:

激励布兰德的线性规划推广著名的Edmonds-Karp有效细化的福特-富克尔森最大流算法,我们讨论了三个密切相关的自然增强规则的线性和整数线性最优化。在几个很好的情况下,我们表明,多项式许多扩增步骤足以达到最佳。特别地,当使用“离散最陡下降增强”(即,方向的最佳比率的成本改善每单位1-范数长度),我们表明,增加步骤的数量是有界的问题矩阵的Graver基中的元素的数量,给出了有史以来第一个强多项式时间算法的$N$倍整数线性最优化。我们的结果还改进了在线性最优化的上下文中对此类算法所知的内容(例如,推广了Kitahara和Mizuno关于单纯形法中步骤数的界限),并且与多面体直径的研究和对强多项式时间单纯形或增强算法的搜索密切相关。

英文摘要:

Motivated by Bland's linear-programming generalization of the renowned Edmonds-Karp efficient refinement of the Ford-Fulkerson maximum-flow algorithm, we discuss three closely-related natural augmentation rules for linear and integer-linear optimization. In several nice situations, we show that polynomially-many augmentation steps suffice to reach an optimum. In particular, when using "discrete steepest-descent augmentations" (i.e., directions with the best ratio of cost improvement per unit 1-norm length), we show that the number of augmentation steps is bounded by the number of elements in the Graver basis of the problem matrix, giving the first ever strongly polynomial-time algorithm for $N$-fold integer-linear optimization. Our results also improve on what is known for such algorithms in the context of linear optimization (e.g., generalizing the bounds of Kitahara and Mizuno for the number of steps in the simplex method) and are closely related to research on the diameters of polytopes and the search for a strongly polynomial-time simplex or augmentation algorithm.

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

↑