Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/620015
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHongxing Yeen_US
dc.contributor.authorZuyi Lien_US
dc.date.accessioned2020-05-20T09:21:44Z-
dc.date.available2020-05-20T09:21:44Z-
dc.date.issued2016en_US
dc.identifier.issn0885-8950en_US
dc.identifier.issn1558-0679en_US
dc.identifier.other10.1109/TPWRS.2015.2508643en_US
dc.identifier.urihttp://localhost/handle/Hannan/148998en_US
dc.identifier.urihttp://localhost/handle/Hannan/620015-
dc.description.abstractIn this letter, a set of general necessary conditions for line congestions are established during ramping delivery, i.e., the redispatch process for uncertainty accommodation. Mathematically, the consideration of all line flow constraints may cause the intractability of the max-min problem in robust security-constrained unit commitment and dispatch. Without solving time-consuming linear programming (LP) problems, the lines that will not be congested can be quickly identified based on the necessary conditions and corresponding line flow constraints can be removed from the max-min subproblem in robust approaches. A promising application of the conditions is presented via the preprocessed max-min problem with high computational performance.en_US
dc.publisherIEEEen_US
dc.relation.haspart7361766.pdfen_US
dc.subjectLine congestion|ramping delivery|reserve|robust optimizationen_US
dc.titleNecessary Conditions of Line Congestions in Uncertainty Accommodationen_US
dc.typeArticleen_US
dc.journal.volume31en_US
dc.journal.issue5en_US
dc.journal.titleIEEE Transactions on Power Systemsen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7361766.pdf653.31 kBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHongxing Yeen_US
dc.contributor.authorZuyi Lien_US
dc.date.accessioned2020-05-20T09:21:44Z-
dc.date.available2020-05-20T09:21:44Z-
dc.date.issued2016en_US
dc.identifier.issn0885-8950en_US
dc.identifier.issn1558-0679en_US
dc.identifier.other10.1109/TPWRS.2015.2508643en_US
dc.identifier.urihttp://localhost/handle/Hannan/148998en_US
dc.identifier.urihttp://localhost/handle/Hannan/620015-
dc.description.abstractIn this letter, a set of general necessary conditions for line congestions are established during ramping delivery, i.e., the redispatch process for uncertainty accommodation. Mathematically, the consideration of all line flow constraints may cause the intractability of the max-min problem in robust security-constrained unit commitment and dispatch. Without solving time-consuming linear programming (LP) problems, the lines that will not be congested can be quickly identified based on the necessary conditions and corresponding line flow constraints can be removed from the max-min subproblem in robust approaches. A promising application of the conditions is presented via the preprocessed max-min problem with high computational performance.en_US
dc.publisherIEEEen_US
dc.relation.haspart7361766.pdfen_US
dc.subjectLine congestion|ramping delivery|reserve|robust optimizationen_US
dc.titleNecessary Conditions of Line Congestions in Uncertainty Accommodationen_US
dc.typeArticleen_US
dc.journal.volume31en_US
dc.journal.issue5en_US
dc.journal.titleIEEE Transactions on Power Systemsen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7361766.pdf653.31 kBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHongxing Yeen_US
dc.contributor.authorZuyi Lien_US
dc.date.accessioned2020-05-20T09:21:44Z-
dc.date.available2020-05-20T09:21:44Z-
dc.date.issued2016en_US
dc.identifier.issn0885-8950en_US
dc.identifier.issn1558-0679en_US
dc.identifier.other10.1109/TPWRS.2015.2508643en_US
dc.identifier.urihttp://localhost/handle/Hannan/148998en_US
dc.identifier.urihttp://localhost/handle/Hannan/620015-
dc.description.abstractIn this letter, a set of general necessary conditions for line congestions are established during ramping delivery, i.e., the redispatch process for uncertainty accommodation. Mathematically, the consideration of all line flow constraints may cause the intractability of the max-min problem in robust security-constrained unit commitment and dispatch. Without solving time-consuming linear programming (LP) problems, the lines that will not be congested can be quickly identified based on the necessary conditions and corresponding line flow constraints can be removed from the max-min subproblem in robust approaches. A promising application of the conditions is presented via the preprocessed max-min problem with high computational performance.en_US
dc.publisherIEEEen_US
dc.relation.haspart7361766.pdfen_US
dc.subjectLine congestion|ramping delivery|reserve|robust optimizationen_US
dc.titleNecessary Conditions of Line Congestions in Uncertainty Accommodationen_US
dc.typeArticleen_US
dc.journal.volume31en_US
dc.journal.issue5en_US
dc.journal.titleIEEE Transactions on Power Systemsen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7361766.pdf653.31 kBAdobe PDFThumbnail
Preview File