基于混合弯曲分解和混合整数非线性规划的安全约束单元承诺

S. M. Ezzati, G. Yousefi, M. Pedram, M. Baghdadi
{"title":"基于混合弯曲分解和混合整数非线性规划的安全约束单元承诺","authors":"S. M. Ezzati, G. Yousefi, M. Pedram, M. Baghdadi","doi":"10.1109/ENERGYCON.2010.5771683","DOIUrl":null,"url":null,"abstract":"This paper presents a formulation of security constrained unit commitment (SCUC) with emphasizing on Mixed Integer Nonlinear Programming (MINLP) and Benders Decomposition. The problem is finding a solution which satisfies the constraints and maximizes the objective function. The proposed method is solved using MINLP using solver in GAMS software. As a case study, results on IEEE 30-bus system are presented in this paper.","PeriodicalId":386008,"journal":{"name":"2010 IEEE International Energy Conference","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Security-constrained unit commitment based on hybrid benders decomposition and mixed integer non-linear programming\",\"authors\":\"S. M. Ezzati, G. Yousefi, M. Pedram, M. Baghdadi\",\"doi\":\"10.1109/ENERGYCON.2010.5771683\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a formulation of security constrained unit commitment (SCUC) with emphasizing on Mixed Integer Nonlinear Programming (MINLP) and Benders Decomposition. The problem is finding a solution which satisfies the constraints and maximizes the objective function. The proposed method is solved using MINLP using solver in GAMS software. As a case study, results on IEEE 30-bus system are presented in this paper.\",\"PeriodicalId\":386008,\"journal\":{\"name\":\"2010 IEEE International Energy Conference\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Energy Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ENERGYCON.2010.5771683\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Energy Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ENERGYCON.2010.5771683","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

本文给出了安全约束单元承诺(SCUC)的一个公式,重点讨论了混合整数非线性规划(MINLP)和Benders分解。问题是找到满足约束条件并使目标函数最大化的解。利用GAMS软件中的求解器对该方法进行求解。本文以IEEE 30总线系统为例,给出了相应的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Security-constrained unit commitment based on hybrid benders decomposition and mixed integer non-linear programming
This paper presents a formulation of security constrained unit commitment (SCUC) with emphasizing on Mixed Integer Nonlinear Programming (MINLP) and Benders Decomposition. The problem is finding a solution which satisfies the constraints and maximizes the objective function. The proposed method is solved using MINLP using solver in GAMS software. As a case study, results on IEEE 30-bus system are presented in this paper.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信