arrow
返回

Second-Order Conic Programming Approach for Wasserstein Distributionally Robust Two-Stage Linear Programs

delete2022-04-01
delete6
delete
OA
AI
Z
Zhuolin Wang
游
游科友 (Keyou You) *
宋
宋士吉 (Shiji Song)
张
张玉利 (Yuli Zhang)
DOI:10.1109/TASE.2021.3056429delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
This article proposes a second-order conic programming (SOCP) approach to solve distributionally robust two-stage linear programs over 1-Wasserstein balls. We start from the case with distribution uncertainty only in the objective function and then explore the case with distribution uncertainty only in constraints. The former program is exactly reformulated as a tractable SOCP problem, whereas the latter one is proved to be generally NP-hard as it involves a norm maximization problem over a polyhedron. However, it reduces to an SOCP problem if the extreme points of the polyhedron are given as a prior. This motivates the design of a constraint generation algorithm with provable convergence to approximately solve the NP-hard problem. Moreover, the least favorable distribution achieving the worst case cost is given as an ``empirical'' distribution by simply perturbing each original sample for both cases. Finally, experiments illustrate the advantages of the proposed model in terms of the out-of-sample performance and computational complexity.
Keyword:
Uncertainty
Stochastic processes
Computational modeling
Linear programming
Optimization
Convergence
Programming
Data-driven robust
distribution uncertainty
two-stage linear program
uncertainty model
Wasserstein ball
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Automation Science and Engineering 封面图
IEEE Transactions on Automation Science and Engineering
IF:
6.4
论文数:
5.1K
被引数:
1.6W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
B
beijing institute of technology
学者数:
5.5W
论文数: 4.0W
被引数: 63
引用论文

引用论文

err分享
err收藏
学者 查看更多内容