Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/620015
Title: Necessary Conditions of Line Congestions in Uncertainty Accommodation
Authors: Hongxing Ye;Zuyi Li
subject: Line congestion|ramping delivery|reserve|robust optimization
Year: 2016
Publisher: IEEE
Abstract: In 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.
URI: http://localhost/handle/Hannan/148998
http://localhost/handle/Hannan/620015
ISSN: 0885-8950
1558-0679
volume: 31
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7361766.pdf653.31 kBAdobe PDFThumbnail
Preview File
Title: Necessary Conditions of Line Congestions in Uncertainty Accommodation
Authors: Hongxing Ye;Zuyi Li
subject: Line congestion|ramping delivery|reserve|robust optimization
Year: 2016
Publisher: IEEE
Abstract: In 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.
URI: http://localhost/handle/Hannan/148998
http://localhost/handle/Hannan/620015
ISSN: 0885-8950
1558-0679
volume: 31
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7361766.pdf653.31 kBAdobe PDFThumbnail
Preview File
Title: Necessary Conditions of Line Congestions in Uncertainty Accommodation
Authors: Hongxing Ye;Zuyi Li
subject: Line congestion|ramping delivery|reserve|robust optimization
Year: 2016
Publisher: IEEE
Abstract: In 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.
URI: http://localhost/handle/Hannan/148998
http://localhost/handle/Hannan/620015
ISSN: 0885-8950
1558-0679
volume: 31
issue: 5
Appears in Collections:2016

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