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

构造代表性情景逼近鲁棒组合最优化问题

Constructing Representative Scenarios to Approximate Robust Combinatorial Optimization Problems

Marc Goerigk

摘要:

在具有离散不确定性的鲁棒组合优化问题中,常用的两种近似算法都是基于构造一个单一的场景来表示整个不确定性集。在中点法则中,针对平均情况进行优化。在元素方面的最坏情况的方法,一个构造一个场景,在所有的场景中,每个组件中的最坏情况。已知这两种方法都是$N$ -近似,其中$N$是场景的数量。在本文中,这些结果是通过重新考虑其各自的证明最优化问题。我们提出了一个线性规划,以构建一个代表性的情况下的不确定性集,这保证了近似保证,至少是一样好,为以前的方法。顺便说一句,我们表明,元素明智的最坏情况下的方法可以有一个优势,如果情况的数量是大的中点的方法。在选择问题的数值实验中,我们证明了我们的方法可以提高近似保证中点的方法约20%。

英文摘要:

In robust combinatorial optimization with discrete uncertainty, two general approximation algorithms are frequently used, which are both based on constructing a single scenario representing the whole uncertainty set. In the midpoint method, one optimizes for the average case scenario. In the element-wise worst-case approach, one constructs a scenario by taking the worst case in each component over all scenarios. Both methods are known to be $N$-approximations, where $N$ is the number of scenarios. In this paper, these results are refined by reconsidering their respective proofs as optimization problems. We present a linear program to construct a representative scenario for the uncertainty set, which guarantees an approximation guarantee that is at least as good as for the previous methods. Incidentally, we show that the element-wise worst-case approach can have an advantage over the midpoint approach if the number of scenarios is large. In numerical experiments on the selection problem we demonstrate that our approach can improve the approximation guarantee of the midpoint approach by around 20%.

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

↑