arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.09437cs.DMmath.OC
收藏

再探二次二元优化问题的若干经典线性化方法

Revisiting some classical linearizations of the quadratic binary optimization problem

Abraham P. Punnen, Navpreet Kaur

AI总结:

针对二次二元优化问题现有聚合线性化方法因乘子规模大不实用的问题,提出基于约束选择性聚合的新线性化方法,乘子可为任意非零实数,恰当选择时LP松弛值与非聚合模型一致,同时首次系统梳理现有显式线性化方法并开展理论与实验对比。

摘要:

本文针对二次二元优化问题(QBOP)提出了几种新的线性化方法,主要采用聚合方法。尽管过去在求解非负变量丢番图方程组的场景中已有对聚合方法的研究,但已有的方法均未产生具备实用性的模型,核心原因是相关乘子的规模过大。利用QBOP的特殊结构,我们证明对约束进行选择性聚合可得到具有优良性质的有效线性化形式。在我们的聚合方法中,乘子可以是任意非零实数。此外,通过恰当选择乘子,我们证明所得的LP松弛(线性规划松弛)的取值与对应的非聚合模型完全一致。本文还梳理了现有的QBOP显式线性化方法,并首次对这类模型展开了系统性研究,同时对新模型与现有模型进行了理论与实验层面的比较。

英文摘要:

In this paper, we present several new linearizations of a quadratic binary optimization problem (QBOP), primarily using the method of aggregations. Although aggregations were studied in the past in the context of solving system of Diophantine equations in non-negative variables, none of the approaches developed produced practical models, particularly due to the large size of associate multipliers. Exploiting the special structure of QBOP we show that selective aggregation of constraints provide valid linearizations with interesting properties. For our aggregations, multipliers can be any non-zero real numbers. Moreover, choosing the multipliers appropriately, we demonstrate that the resulting LP relaxations have value identical to the corresponding non-aggregated models. We also provide a review of existing explicit linearizations of QBOP and presents the first systematic study of such models. Theoretical and experimental comparisons of new and existing models are also provided.

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

↑