Performance evaluation for distributionally robust optimization with binary entries
We consider the data-driven stochastic programming problem with binary entries where the probability of existence of each entry is not known, instead realization of data is provided. We applied the distributionally robust optimization technique to minimize the worst-case expected cost taken over the...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Balikesir University
2020-09-01
|
| Series: | An International Journal of Optimization and Control: Theories & Applications |
| Subjects: | |
| Online Access: | http://www.ijocta.org/index.php/files/article/view/911 |
| Summary: | We consider the data-driven stochastic programming problem with binary entries where the probability of existence of each entry is not known, instead realization of data is provided. We applied the distributionally robust optimization technique to minimize the worst-case expected cost taken over the ambiguity set based on the Kullback-Leibler divergence. We investigate the out-of-sample performance of the resulting optimal decision and analyze its dependence on the sparsity of the problem. |
|---|---|
| ISSN: | 2146-0957 2146-5703 |