arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.00573math.OCcs.DCcs.DMcs.SYeess.SYmath.CO
收藏

混合整数线性规划的拉格朗日松弛综述:重要性、挑战、历史回顾、最新进展与机遇

Survey on Lagrangian Relaxation for MILP: Importance, Challenges, Historical Review, Recent Advancements, and Opportunities

Mikhail A. Bragin

AI总结:

本文综述了拉格朗日松弛在求解MILP问题中的重要性、历史里程碑(自1967年Polyak工作起)与最新进展,并探讨了其当前的应用机遇。

摘要:

对社会重要领域的运作问题经常被建模为混合整数线性规划(MILP)问题。虽然MILP问题存在组合复杂性,但拉格朗日松弛一直是通过分解来解决相关困难的希望所在。由于拉格朗日对偶函数的非光滑性质,该方法的协调方面带来了严峻挑战。本文介绍了若干重要的历史里程碑(始于Polyak在1967年的开创性工作),这些里程碑通过改进非光滑泛函的优化来改善拉格朗日松弛的协调。最后,本文介绍了拉格朗日松弛在快速求解MILP问题方面的最新进展。本文还简要讨论了拉格朗日松弛在当前时点能够提供的机会。

英文摘要:

Operations in areas of importance to society are frequently modeled as Mixed-Integer Linear Programming (MILP) problems. While MILP problems suffer from combinatorial complexity, Lagrangian Relaxation has been a beacon of hope to resolve the associated difficulties through decomposition. Due to the non-smooth nature of Lagrangian dual functions, the coordination aspect of the method has posed serious challenges. This paper presents several significant historical milestones (beginning with Polyak's pioneering work in 1967) toward improving Lagrangian Relaxation coordination through improved optimization of non-smooth functionals. Finally, this paper presents the most recent developments in Lagrangian Relaxation for fast resolution of MILP problems. The paper also briefly discusses the opportunities that Lagrangian Relaxation can provide at this point in time.

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

↑