OPF问题的无限点算法

Giorgio Tognola, R. Bacher
{"title":"OPF问题的无限点算法","authors":"Giorgio Tognola, R. Bacher","doi":"10.1109/PICA.1997.599390","DOIUrl":null,"url":null,"abstract":"A nonlinear optimal power flow (OPF) algorithm is presented which allows to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using a pure Newton-Raphson solution procedure. The method is similar to interior point algorithms. However, due to a simple transformation, the variable space becomes unlimited (unlimited point) and variables do not need to be forced to stay within the feasible region during all OPF iterations as is the case for interior point algorithms. As a consequence only a pure Newton-Raphson iterative process to algebraically transformed KKT conditions is applied. The algorithm has been successfully applied to various networks up to size 700 buses with the active power loss objective function.","PeriodicalId":383749,"journal":{"name":"Proceedings of the 20th International Conference on Power Industry Computer Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Unlimited point algorithm for OPF problems\",\"authors\":\"Giorgio Tognola, R. Bacher\",\"doi\":\"10.1109/PICA.1997.599390\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A nonlinear optimal power flow (OPF) algorithm is presented which allows to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using a pure Newton-Raphson solution procedure. The method is similar to interior point algorithms. However, due to a simple transformation, the variable space becomes unlimited (unlimited point) and variables do not need to be forced to stay within the feasible region during all OPF iterations as is the case for interior point algorithms. As a consequence only a pure Newton-Raphson iterative process to algebraically transformed KKT conditions is applied. The algorithm has been successfully applied to various networks up to size 700 buses with the active power loss objective function.\",\"PeriodicalId\":383749,\"journal\":{\"name\":\"Proceedings of the 20th International Conference on Power Industry Computer Applications\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 20th International Conference on Power Industry Computer Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PICA.1997.599390\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 20th International Conference on Power Industry Computer Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICA.1997.599390","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45

摘要

提出了一种非线性最优潮流(OPF)算法,该算法允许使用纯牛顿-拉夫森求解过程求解Karush-Kuhn-Tucker (KKT)最优性条件。该方法与内点算法类似。然而,由于简单的变换,变量空间变得无限(无限点),并且不需要像内点算法那样在所有OPF迭代过程中强制变量保持在可行区域内。因此,仅对代数变换的KKT条件应用纯牛顿-拉夫森迭代过程。该算法已成功应用于以有功损耗为目标函数的700总线以下的各种网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Unlimited point algorithm for OPF problems
A nonlinear optimal power flow (OPF) algorithm is presented which allows to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using a pure Newton-Raphson solution procedure. The method is similar to interior point algorithms. However, due to a simple transformation, the variable space becomes unlimited (unlimited point) and variables do not need to be forced to stay within the feasible region during all OPF iterations as is the case for interior point algorithms. As a consequence only a pure Newton-Raphson iterative process to algebraically transformed KKT conditions is applied. The algorithm has been successfully applied to various networks up to size 700 buses with the active power loss objective function.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信