Salvato in:
Dettagli Bibliografici
Autori principali: Lin, Yue, Long, Daniel Zhuoyu, Nguyen, Viet Anh, Qi, Jin
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:https://arxiv.org/abs/2412.17257
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917876576813056
author Lin, Yue
Long, Daniel Zhuoyu
Nguyen, Viet Anh
Qi, Jin
author_facet Lin, Yue
Long, Daniel Zhuoyu
Nguyen, Viet Anh
Qi, Jin
contents Two-stage risk-averse distributionally robust optimization (DRO) problems are ubiquitous across many engineering and business applications. Despite their promising resilience, two-stage DRO problems are generally computationally intractable. To address this challenge, we propose a simple framework by decentralizing the decision-making process into two specialized teams: forecasting and operations. This decentralization aligns with prevalent organizational practices, in which the operations team uses the information communicated from the forecasting team as input to make decisions. We formalize this decentralized procedure as a bilevel problem to design a communicated distribution that can yield asymptotic optimal solutions to original two-stage risk-averse DRO problems. We identify an optimal solution that is surprisingly simple: The forecasting team only needs to communicate a two-point distribution to the operations team. Consequently, the operations team can solve a highly tractable and scalable optimization problem to identify asymptotic optimal solutions. Specifically, as the magnitude of the problem parameters (including the uncertain parameters and the first-stage capacity) increases to infinity at an appropriate rate, the cost ratio between our induced solution and the original optimal solution converges to one, indicating that our decentralized approach yields high-quality solutions. We compare our decentralized approach against the truncated linear decision rule approximation and demonstrate that our approach has broader applicability and superior computational efficiency while maintaining competitive performance. Using real-world sales data, we have demonstrated the practical effectiveness of our strategy. The finely tuned solution significantly outperforms traditional sample-average approximation methods in out-of-sample performance.
format Preprint
id arxiv_https___arxiv_org_abs_2412_17257
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Asymptotically Optimal Distributionally Robust Solutions through Forecasting and Operations Decentralization
Lin, Yue
Long, Daniel Zhuoyu
Nguyen, Viet Anh
Qi, Jin
Optimization and Control
Two-stage risk-averse distributionally robust optimization (DRO) problems are ubiquitous across many engineering and business applications. Despite their promising resilience, two-stage DRO problems are generally computationally intractable. To address this challenge, we propose a simple framework by decentralizing the decision-making process into two specialized teams: forecasting and operations. This decentralization aligns with prevalent organizational practices, in which the operations team uses the information communicated from the forecasting team as input to make decisions. We formalize this decentralized procedure as a bilevel problem to design a communicated distribution that can yield asymptotic optimal solutions to original two-stage risk-averse DRO problems. We identify an optimal solution that is surprisingly simple: The forecasting team only needs to communicate a two-point distribution to the operations team. Consequently, the operations team can solve a highly tractable and scalable optimization problem to identify asymptotic optimal solutions. Specifically, as the magnitude of the problem parameters (including the uncertain parameters and the first-stage capacity) increases to infinity at an appropriate rate, the cost ratio between our induced solution and the original optimal solution converges to one, indicating that our decentralized approach yields high-quality solutions. We compare our decentralized approach against the truncated linear decision rule approximation and demonstrate that our approach has broader applicability and superior computational efficiency while maintaining competitive performance. Using real-world sales data, we have demonstrated the practical effectiveness of our strategy. The finely tuned solution significantly outperforms traditional sample-average approximation methods in out-of-sample performance.
title Asymptotically Optimal Distributionally Robust Solutions through Forecasting and Operations Decentralization
topic Optimization and Control
url https://arxiv.org/abs/2412.17257