IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v83y2016i3d10.1007_s00186-016-0532-6.html
   My bibliography  Save this article

Robust unit commitment with $$n-1$$ n - 1 security criteria

Author

Listed:
  • Arash Gourtani

    (University of Southampton)

  • Huifu Xu

    (University of Southampton)

  • David Pozo

    (Pontificia Universidad Catlica de Chile)

  • Tri-Dung Nguyen

    (University of Southampton)

Abstract

The short-term unit commitment and reserve scheduling decisions are made in the face of increasing supply-side uncertainty in power systems. This has mainly been caused by a higher penetration of renewable energy generation that is encouraged and enforced by the market and policy makers. In this paper, we propose a two-stage stochastic and distributionally robust modeling framework for the unit commitment problem with supply uncertainty. Based on the availability of the information on the distribution of the random supply, we consider two specific models: (a) a moment model where the mean values of the random supply variables are known, and (b) a mixture distribution model where the true probability distribution lies within the convex hull of a finite set of known distributions. In each case, we reformulate these models through Lagrange dualization as a semi-infinite program in the former case and a one-stage stochastic program in the latter case. We solve the reformulated models using sampling method and sample average approximation, respectively. We also establish exponential rate of convergence of the optimal value when the randomization scheme is applied to discretize the semi-infinite constraints. The proposed robust unit commitment models are applied to an illustrative case study, and numerical test results are reported in comparison with the two-stage non-robust stochastic programming model.

Suggested Citation

  • Arash Gourtani & Huifu Xu & David Pozo & Tri-Dung Nguyen, 2016. "Robust unit commitment with $$n-1$$ n - 1 security criteria," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 83(3), pages 373-408, June.
  • Handle: RePEc:spr:mathme:v:83:y:2016:i:3:d:10.1007_s00186-016-0532-6
    DOI: 10.1007/s00186-016-0532-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00186-016-0532-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00186-016-0532-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sanjay Mehrotra & David Papp, 2013. "A cutting surface algorithm for semi-infinite convex programming with an application to moment robust optimization," Papers 1306.3437, arXiv.org, revised Aug 2014.
    2. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    3. Tuohy, Aidan & Meibom, Peter & Denny, Eleanor & O'Malley, Mark, 2009. "Unit commitment for systems with significant wind penetration," MPRA Paper 34849, University Library of Munich, Germany.
    4. David Wozabal, 2014. "Robustifying Convex Risk Measures for Linear Portfolios: A Nonparametric Approach," Operations Research, INFORMS, vol. 62(6), pages 1302-1315, December.
    5. Wolfram Wiesemann & Daniel Kuhn & Berç Rustem, 2013. "Robust Markov Decision Processes," Mathematics of Operations Research, INFORMS, vol. 38(1), pages 153-183, February.
    6. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    7. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    8. Shushang Zhu & Masao Fukushima, 2009. "Worst-Case Conditional Value-at-Risk with Application to Robust Portfolio Management," Operations Research, INFORMS, vol. 57(5), pages 1155-1168, October.
    9. Dimitris Bertsimas & Xuan Vinh Doan & Karthik Natarajan & Chung-Piaw Teo, 2010. "Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 580-602, August.
    10. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    11. Joel Goh & Melvyn Sim, 2010. "Distributionally Robust Optimization and Its Tractable Approximations," Operations Research, INFORMS, vol. 58(4-part-1), pages 902-917, August.
    12. Anderson, Edward & Xu, Huifu & Zhang, Dali, 2014. "Confidence Levels for CVaR Risk Measures and Minimax Limits," Working Papers 2014_01, University of Sydney Business School, Discipline of Business Analytics.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gabrel, Virginie & Murat, Cécile & Thiele, Aurélie, 2014. "Recent advances in robust optimization: An overview," European Journal of Operational Research, Elsevier, vol. 235(3), pages 471-483.
    2. Wei Liu & Li Yang & Bo Yu, 2021. "KDE distributionally robust portfolio optimization with higher moment coherent risk," Annals of Operations Research, Springer, vol. 307(1), pages 363-397, December.
    3. Hailin Sun & Huifu Xu, 2016. "Convergence Analysis for Distributionally Robust Optimization and Equilibrium Problems," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 377-401, May.
    4. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    5. Steffen Rebennack, 2022. "Data-driven stochastic optimization for distributional ambiguity with integrated confidence region," Journal of Global Optimization, Springer, vol. 84(2), pages 255-293, October.
    6. Wang, Fan & Zhang, Chao & Zhang, Hui & Xu, Liang, 2021. "Short-term physician rescheduling model with feature-driven demand for mental disorders outpatients," Omega, Elsevier, vol. 105(C).
    7. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    8. Marla, Lavanya & Rikun, Alexander & Stauffer, Gautier & Pratsini, Eleni, 2020. "Robust modeling and planning: Insights from three industrial applications," Operations Research Perspectives, Elsevier, vol. 7(C).
    9. Shipra Agrawal & Yichuan Ding & Amin Saberi & Yinyu Ye, 2012. "Price of Correlations in Stochastic Optimization," Operations Research, INFORMS, vol. 60(1), pages 150-162, February.
    10. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    11. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    12. Wang, Changjun & Chen, Shutong, 2020. "A distributionally robust optimization for blood supply network considering disasters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 134(C).
    13. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    14. Huan Xu & Constantine Caramanis & Shie Mannor, 2012. "A Distributional Interpretation of Robust Optimization," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 95-110, February.
    15. Hu, Jian & Bansal, Manish & Mehrotra, Sanjay, 2018. "Robust decision making using a general utility set," European Journal of Operational Research, Elsevier, vol. 269(2), pages 699-714.
    16. Wei Liu & Li Yang & Bo Yu, 2022. "Kernel density estimation based distributionally robust mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 84(4), pages 1053-1077, December.
    17. Zhi Chen & Weijun Xie, 2021. "Regret in the Newsvendor Model with Demand and Yield Randomness," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4176-4197, November.
    18. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    19. Chassein, André & Goerigk, Marc, 2018. "Compromise solutions for robust combinatorial optimization with variable-sized uncertainty," European Journal of Operational Research, Elsevier, vol. 269(2), pages 544-555.
    20. Shunichi Ohmori, 2021. "A Predictive Prescription Using Minimum Volume k -Nearest Neighbor Enclosing Ellipsoid and Robust Optimization," Mathematics, MDPI, vol. 9(2), pages 1-16, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:83:y:2016:i:3:d:10.1007_s00186-016-0532-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.