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

决策依赖不确定性的两阶段鲁棒Optimization

Two-Stage Robust Optimization with Decision Dependent Uncertainty

Bo Zeng, Wei Wang

摘要:

决策相关不确定性给决策带来了很大的挑战,而现有的方法不足以支持许多实际应用。在本文中,我们提出了一个系统的研究,以应对这一挑战的两阶段鲁棒优化~(RO)。我们的主要贡献包括列和约束生成方法的三个复杂的变体,以准确地计算基于DDU的两阶段RO。通过对线性规划核心概念的一种新的应用,我们对它们的计算行为进行了严格的分析。有趣的是,就这些算法的迭代复杂度而言,基于DDU的两阶段RO并不比基于决策独立不确定性(DIU)的算法更苛刻。值得强调的是一个违反直觉的发现,即通过利用“深度知识”将DIU集合转换为DDU集合,然后计算所得的基于DDU的公式,可能会导致显著的改进。事实上,如本文所示,除了捕捉现实世界中存在的实际依赖性,DDU是一个强大而灵活的工具,代表和利用分析属性或简单的领域专业知识,以实现强解能力。因此,我们相信这将为解决大规模基于DIU或DDU的RO开辟一个新的方向。其他重要的结果包括基本的结构特性,两阶段RO,近似计划,以处理混合整数追索权,和一对夫妇的增强技术的开发算法,以及有组织的数值研究,以帮助我们欣赏所有的算法和增强技术的计算性能。

英文摘要:

The type of decision dependent uncertainties (DDUs) imposes a great challenge in decision making, while existing methodologies are not sufficient to support many real practices. In this paper, we present a systematic study to handle this challenge in two-stage robust optimization~(RO). Our main contributions include three sophisticated variants of column-and-constraint generation method to exactly compute DDU-based two-stage RO. By a novel application of core concepts of linear programming, we provide rigorous analyses on their computational behaviors. Interestingly, in terms of the iteration complexity of those algorithms, DDU-based two-stage RO is not more demanding than its decision independent uncertainty (DIU) based counterpart. It is worth highlighting a counterintuitive discovery that converting a DIU set into a DDU set by making use of "deep knowledge" and then computing the resulting DDU-based formulation may lead to a significant improvement. Indeed, as shown in this paper, in addition to capturing the actual dependence existing in the real world, DDU is a powerful and flexible tool to represent and leverage analytical properties or simply domain expertise to achieve a strong solution capacity. So, we believe it will open a new direction to solve large-scale DIU- or DDU-based RO. Other important results include basic structural properties for two-stage RO, an approximation scheme to deal with mixed integer recourse, and a couple of enhancement techniques for the developed algorithms, as well as an organized numerical study to help us appreciate all algorithms and enhancement techniques' computational performances.

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

↑