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

混合整数线性规划全局解的分解方法

Decomposition Methods for Global Solutions of Mixed-Integer Linear Programs

Kaizhao Sun, Mou Sun, Wotao Yin

AI总结:

本文针对两块混合整数线性规划提出两种分解方法(基于$\ell_1$-ALM和改进ADMM),通过求解低维子问题并添加非凸割,在适当条件下收敛至全局最优,数值实验显示其在结构化问题上优于现有求解器。

摘要:

本文针对两块混合整数线性规划(MILPs)提出两种基于分解的方法,旨在通过求解一系列低维MILPs来利用原问题的可分结构。第一种方法基于$\ell_1$-增广拉格朗日方法(ALM),第二种基于改进的交替方向乘子法(ADMM)。在特定块角结构下,两种方法均在一个变量块中生成并行子问题,并添加非凸割来更新另一块;在适当条件下,它们收敛至原MILP的全局最优解。三类MILPs的数值实验表明,所提方法在结构化问题上优于现有最先进的MILP求解器。

英文摘要:

This paper introduces two decomposition-based methods for two-block mixed-integer linear programs (MILPs), which aim to take advantage of separable structures of the original problem by solving a sequence of lower-dimensional MILPs. The first method is based on the $\ell_1$-augmented Lagrangian method (ALM), and the second one is based on a modified alternating direction method of multipliers (ADMM). In the presence of certain block-angular structures, both methods create parallel subproblems in one block of variables, and add nonconvex cuts to update the other block; they converge to globally optimal solutions of the original MILP under proper conditions. Numerical experiments on three classes of MILPs demonstrate the advantages of the proposed methods on structured problems over the state-of-the-art MILP solvers.

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

↑