arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2309.08693math.OCcs.DM
收藏

伪布尔多面体与二元多项式优化的多项式规模扩展表述

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization

Alberto Del Pia, Aida Khajavirad

AI总结:

本文引入伪布尔多面体,并借助带符号超图给出其具有多项式规模扩展表述的充分条件,统一并扩展了三次及以上二元多项式优化问题凸包多项式规模扩展表述的已有结果。

摘要:

为了获得二元多项式优化问题的强松弛,我们引入了伪布尔多面体,其定义为满足一组包含伪布尔函数的方程的二元点集合的凸包。通过用带符号超图表示伪布尔多面体,我们得到了该多面体具有多项式规模扩展表述的充分条件。我们的新框架统一并扩展了所有先前关于次数至少为三的二元多项式优化问题可行域凸包存在多项式规模扩展表述的结果。

英文摘要:

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing pseudo-Boolean functions. By representing the pseudo-Boolean polytope via a signed hypergraph, we obtain sufficient conditions under which this polytope has a polynomial-size extended formulation. Our new framework unifies and extends all prior results on the existence of polynomial-size extended formulations for the convex hull of the feasible region of binary polynomial optimization problems of degree at least three.

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

↑