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

Benders分解的最深割

Deepest Cuts for Benders Decomposition

Tippie College of Business, University of Iowa(爱荷华大学蒂皮商学院);The Paul Merage School of Business, University of California, Irvine(加州大学欧文分校保罗·梅拉吉商学院)

Mojtaba Hosseini, John Turner

AI总结:

针对Benders分解中割平面不唯一的问题,提出基于$\ell_p$范数的最深割统一选择技术,结合几何解释设计相关算法,可减少迭代次数与计算时间,早期迭代即可生成高质量界。

摘要:

自诞生以来,Benders分解(BD)已成功应用于各类大规模混合整数(线性)问题。BD的核心要素是Benders割的推导,而这类割平面通常并不唯一。本文提出一种基于割平面“深度”几何解释的新型统一Benders割选择技术,基于$\ell_p$范数生成最深Benders割,并研究其性质。具体而言,我们证明最深割通过与当前可行点的最小偏差(距离意义上)来消除不可行性,具有相对稀疏的特点,且即使在经典Benders方法需要可行性割的场景下,也能生成最优性割。利用分离与投影之间的对偶性,我们开发了一种引导投影算法来生成最深割,同时利用问题实例的组合结构与可分解性。随后,我们对Benders分离问题进行了推广,该推广不仅将多种知名的割选择策略纳入统一框架,而且在赋予齐次函数时,具备几何分离问题的若干性质。我们证明,当齐次函数为线性函数时,该分离问题呈现为最小不可行子系统(MIS)问题的形式。据此,我们提供了选择MIS方法归一化系数的系统方法,并提出了一种有向深度最大化算法来推导这些割。受基于距离的割的几何解释以及两阶段随机规划的重复性特征启发,我们引入了一种定制算法来进一步简化这些割的推导过程。我们在各类基准问题上开展的计算实验表明,最深割在减少计算时间和Benders迭代次数方面具有有效性,且能在早期迭代中生成高质量的界。

英文摘要:

Since its inception, Benders Decomposition (BD) has been successfully applied to a wide range of large-scale mixed-integer (linear) problems. The key element of BD is the derivation of Benders cuts, which are often not unique. In this paper, we introduce a novel unifying Benders cut selection technique based on a geometric interpretation of cut ``depth'', produce deepest Benders cuts based on $\ell_p$-norms, and study their properties. Specifically, we show that deepest cuts resolve infeasibility through minimal deviation (in a distance sense) from the incumbent point, are relatively sparse, and may produce optimality cuts even when classical Benders would require a feasibility cut. Leveraging the duality between separation and projection, we develop a Guided Projections Algorithm for producing deepest cuts while exploiting the combinatorial structure and decomposability of problem instances. We then propose a generalization of our Benders separation problem, which not only brings several well-known cut selection strategies under one umbrella, but also, when endowed with a homogeneous function, enjoys several properties of geometric separation problems. We show that, when the homogeneous function is linear, the separation problem takes the form of the Minimal Infeasible Subsystems (MIS) problem. As such, we provide systematic ways of selecting the normalization coefficients of the MIS method, and introduce a Directed Depth-Maximizing Algorithm for deriving these cuts. Inspired by the geometric interpretation of distance-based cuts and the repetitive nature of two-stage stochastic programs, we introduce a tailored algorithm to further facilitate deriving these cuts. Our computational experiments on various benchmark problems illustrate effectiveness of deepest cuts in reducing both computation time and number of Benders iterations, and producing high quality bounds at early iterations.

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

↑