具有离散不确定性的可恢复鲁棒代表选择问题
Recoverable Robust Representatives Selection Problems with Discrete Budgeted Uncertainty
摘要:
可恢复鲁棒优化是一个多阶段的方法,它是可能的调整后,不确定的成本情况下,揭示了第一阶段的解决方案。我们分析这种方法的一类选择问题。目的是从几个不相交的集合中选择固定数量的项目,以便在采取恢复行动后,最坏情况下的成本尽可能小。不确定性被建模为一个离散的预算集,对手可以增加固定数量的项目的成本。虽然以前已经研究过这个问题的特殊情况,但其复杂性仍然是开放的。在这项工作中,我们为缩小这一差距做出了一些贡献。我们证明了这个问题是NP-困难的,并确定了一个特殊的情况下,仍然可以在多项式时间内解决。我们提供了一个紧凑的混合整数规划配方和两个额外的扩展配方。最后,计算结果比较不同的精确解方法的效率。
英文摘要:
Recoverable robust optimization is a multi-stage approach, where it is possible to adjust a first-stage solution after the uncertain cost scenario is revealed. We analyze this approach for a class of selection problems. The aim is to choose a fixed number of items from several disjoint sets, such that the worst-case costs after taking a recovery action are as small as possible. The uncertainty is modeled as a discrete budgeted set, where the adversary can increase the costs of a fixed number of items. While special cases of this problem have been studied before, its complexity has remained open. In this work we make several contributions towards closing this gap. We show that the problem is NP-hard and identify a special case that remains solvable in polynomial time. We provide a compact mixed-integer programming formulation and two additional extended formulations. Finally, computational results are provided that compare the efficiency of different exact solution approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。