arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.07097math.OC
收藏

两阶段混合鲁棒Optimization的K-适应性

K-Adaptability in Two-Stage Mixed-Integer Robust Optimization

Anirudh Subramanyam, Chrysanthos E. Gounaris, Wolfram Wiesemann

摘要:

本文研究了两阶段混合离散-连续决策的两阶段鲁棒最优化问题。尽管它们的应用范围广泛,这些问题提出了两个基本的挑战:(i)他们构成无限维的问题,需要一个有限维的近似,和(ii)离散追索权的存在决定通常禁止基于对偶的解决方案。我们解决第一个挑战,通过研究一个$K$ -适应性制定,选择$K$候选追索政策之前,观察实现的不确定参数,并实现这些政策的最佳实现后是已知的。我们解决第二个挑战,通过一个分支定界计划,享有渐近收敛一般和有限收敛在特定条件下。我们说明了我们的算法在数值实验中的性能,涉及基准数据从几个应用领域。

英文摘要:

We study two-stage robust optimization problems with mixed discrete-continuous decisions in both stages. Despite their broad range of applications, these problems pose two fundamental challenges: (i) they constitute infinite-dimensional problems that require a finite-dimensional approximation, and (ii) the presence of discrete recourse decisions typically prohibits duality-based solution schemes. We address the first challenge by studying a $K$-adaptability formulation that selects $K$ candidate recourse policies before observing the realization of the uncertain parameters and that implements the best of these policies after the realization is known. We address the second challenge through a branch-and-bound scheme that enjoys asymptotic convergence in general and finite convergence under specific conditions. We illustrate the performance of our algorithm in numerical experiments involving benchmark data from several application domains.

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

↑