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

决策依赖不确定性下的Optimization

Optimization under Decision-Dependent Uncertainty

Omid Nohadani, Kartikey Sharma

摘要:

鲁棒优化的功效跨越各种设置,不确定性在预定集合中有界。在许多应用中,不确定性会受到决策的影响,并且无法用当前的框架进行建模。本文采取了一个步骤,推广鲁棒线性最优化的问题与决策相关的不确定性。在一般情况下,我们证明这些问题是NP完全的。为了减轻计算效率低下,我们引入了一类不确定性集的大小取决于二进制决策。我们提出了改进替代标准线性化技术的重新表述。为了说明这个框架的优点,讨论了一个最短路问题,其中不确定的弧长的决策影响。除了建模和性能优势之外,所提出的主动不确定性控制的概念还减轻了当前鲁棒优化方法的保守性。

英文摘要:

The efficacy of robust optimization spans a variety of settings with uncertainties bounded in predetermined sets. In many applications, uncertainties are affected by decisions and cannot be modeled with current frameworks. This paper takes a step towards generalizing robust linear optimization to problems with decision-dependent uncertainties. In general settings, we show these problems to be NP-complete. To alleviate the computational inefficiencies, we introduce a class of uncertainty sets whose size depends on binary decisions. We propose reformulations that improve upon alternative standard linearization techniques. To illustrate the advantages of this framework, a shortest path problem is discussed, where the uncertain arc lengths are affected by decisions. Beyond the modeling and performance advantages, the proposed notion of proactive uncertainty control also mitigates over conservatism of current robust optimization approaches.

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

↑