双线性函数的McCormick松弛与凸包之间的间隙的界
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
摘要:
我们研究如何以及双线性函数$b:[0,1]^n\to\mathbb{R}$的图形可以近似其麦考密克松弛。特别是,我们感兴趣的是最小的数字$c$,使得从麦考密克松弛方法获得的凹上边界和凸下边界函数之间的差至多是凹包络和凸包络之间的差的$c$倍。通过对Luedtke,Namazifar和Linderoth的一个问题的讨论,我们证明了这个因子$c$不能被一个独立于$n$的常数所约束.更准确地说,我们表明,对于一个随机双线性函数$b$,我们有渐近几乎必然$c\geqslant\sqrt n/4$。另一方面,我们证明了$c\leqslant 600\sqrt{n}$,它改进了Luedtke,Namazifar和Linderoth证明的线性上界。此外,我们还对Misener,Smamadbeck和Floudas特征函数$b$的McCormick松弛等于凸包的一个结果给出了另一种证明.
英文摘要:
We investigate how well the graph of a bilinear function $b:[0,1]^n\to\mathbb{R}$ can be approximated by its McCormick relaxation. In particular, we are interested in the smallest number $c$ such that the difference between the concave upper bounding and convex lower bounding functions obtained from the McCormick relaxation approach is at most $c$ times the difference between the concave and convex envelopes. Answering a question of Luedtke, Namazifar and Linderoth, we show that this factor $c$ cannot be bounded by a constant independent of $n$. More precisely, we show that for a random bilinear function $b$ we have asymptotically almost surely $c\geqslant\sqrt n/4$. On the other hand, we prove that $c\leqslant 600\sqrt{n}$, which improves the linear upper bound proved by Luedtke, Namazifar and Linderoth. In addition, we present an alternative proof for a result of Misener, Smadbeck and Floudas characterizing functions $b$ for which the McCormick relaxation is equal to the convex hull.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。