EconBase
← All papers

Solving Multistage Stochastic Linear Programming via Regularized Linear Decision Rules: An Application to Hydrothermal Dispatch Planning

Felipe Nazare, Alexandre Street

arXiv 7 Oct 2021 · Mathematics — Optimization · publishedEuropean Journal of Operational Research (2022) · 8 citations (OpenAlex)

arXiv:2110.03146 · PDF · DOI · OpenAlex · Extracted main text

Abstract

The solution of multistage stochastic linear problems (MSLP) represents a challenge for many application areas. Long-term hydrothermal dispatch planning (LHDP) materializes this challenge in a real-world problem that affects electricity markets, economies, and natural resources worldwide. No closed-form solutions are available for MSLP and the definition of non-anticipative policies with high-quality out-of-sample performance is crucial. Linear decision rules (LDR) provide an interesting simulation-based framework for finding high-quality policies for MSLP through two-stage stochastic models. In practical applications, however, the number of parameters to be estimated when using an LDR may be close to or higher than the number of scenarios of the sample average approximation problem, thereby generating an in-sample overfit and poor performances in out-of-sample simulations. In this paper, we propose a novel regularized LDR to solve MSLP based on the AdaLASSO (adaptive least absolute shrinkage and selection operator). The goal is to use the parsimony principle, as largely studied in high-dimensional linear regression models, to obtain better out-of-sample performance for LDR applied to MSLP. Computational experiments show that the overfit threat is non-negligible when using classical non-regularized LDR to solve the LHDP, one of the most studied MSLP with relevant applications. Our analysis highlights the following benefits of the proposed framework in comparison to the non-regularized benchmark: 1) significant reductions in the number of non-zero coefficients (model parsimony), 2) substantial cost reductions in out-of-sample evaluations, and 3) improved spot-price profiles.

Citation extraction

46
references
79
in-text mentions
46
distinct cited
0
self-citations
11,564
main-text words

appendix boundary found by none_found · 100% of the source is main text. Read the extracted text to check this.

Most heavily cited references

The works this paper leans on most, across its whole bibliography — not restricted to papers in our corpus. Ranked by composite intensity, which combines how often a work is mentioned, how many sections mention it, and how much of that falls in the main text rather than the appendix.

ReferenceIntensityMentionsSectionsMain text
1M. Bodur, J. R. Luedtke, Two-stage linear decision rules for multi-s… (2018) 1–341.000164100%
2R. P. Masini, M. C. Medeiros, E. F. Mendes, Machine learning advance… (2012) 128020.81142100%
3W.-K. Mak, D. P. Morton, R. K. Wood, Monte carlo bounding techniques… (1999) 47–560.81142100%
4H. Zou, The adaptive lasso and its oracle properties, Journal of the… (2006) 1418–14290.81142100%
5H. Hoeltgebaum, C. Fernandes, A. Street, Generating joint scenarios… (2018) http://dx.doi.org/10.1109/TPWRS.2018.2838050 doi:10.1109/TPWRS.2018.28380500.73732100%
6M. Daryalal, M. Bodur, J. R. Luedtke, Lagrangian dual decision rules… (2001) 007610.73732100%
7M. V. F. Pereira, L. M. V. G. Pinto, https://doi.org/10.1007/BF01582… (1991) http://dx.doi.org/10.1007/BF01582895 doi:10.1007/BF01582895. https://doi.org/10.1007/BF015828950.64422100%
8A. Street, D. Valladão, https://stoprog.org/sites/default/files/sps_… (2021) 14–170.64422100%
9J. Blanchet, Y. Kang, K. Murthy, Robust wasserstein profile inferenc… (2019) 830–8570.51121100%
10G. Ciuperca, http://dx.doi.org/10.1080/02331888.2016.1151427Adaptive… (2016) http://dx.doi.org/10.1080/02331888.2016.1151427 doi:10.1080/02331888.2016.1151427. http://dx.doi.org/10.1080/02331888.2016.11514270.51121100%

Showing the top 10 of 46 scored citations.