Sample average approximation for risk-averse problems: A virtual power plant scheduling application

Ricardo Lima, Antonio J. Conejo, Loic Giraldi, Olivier Le Maître, Ibrahim Hoteit, Omar Knio

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


In this paper, we address the decision-making problem of a virtual power plant (VPP) involving a self-scheduling and market involvement problem under uncertainty in the wind speed and electricity prices. The problem is modeled using a risk-neutral and two risk-averse two-stage stochastic programming formulations, where the conditional value at risk is used to represent risk. A sample average approximation methodology is integrated with an adapted L-Shaped solution method, which can solve risk-neutral and specific risk-averse problems. This methodology provides a framework to understand and quantify the impact of the sample size on the variability of the results. The numerical results include an analysis of the computational performance of the methodology for two case studies, estimators for the bounds of the true optimal solutions of the problems, and an assessment of the quality of the solutions obtained. In particular, numerical experiences indicate that when an adequate sample size is used, the solution obtained is close to the optimal one.
Original languageEnglish (US)
JournalEURO Journal on Computational Optimization
StatePublished - Mar 16 2021

Bibliographical note

KAUST Repository Item: Exported on 2021-04-14
Acknowledgements: Research reported in this publication was supported by research funding from King Abdullah University of Science and Technology (KAUST). Antonio J. Conejo's contribution is partly supported by NSF project 1808169. We would like to thank two referees for their comments and contributions that helped to improve the presentation of this work.


Dive into the research topics of 'Sample average approximation for risk-averse problems: A virtual power plant scheduling application'. Together they form a unique fingerprint.

Cite this