Security-constrained optimal power flow with post-contingency corrective rescheduling

Journal Article · Sun Feb 01 04:00:00 EST 1987 · IEEE Trans. Power Syst.; (United States)

DOI:https://doi.org/10.1109/TPWRS.1987.4335095· OSTI ID:6881210

Monticelli, A; Pereira, M V.F.; Granville, S

This paper describes a mathematical framework for the solution of the economic dispatch problem with security constraints, which can take into account the system corrective capabilities after the outage has occurred. The solution algorithm is based on mathematical programming decomposition techniques that allow the iterative solution of a ''base-case'' economic dispatch and separate contingency analysis with generation rescheduling to eliminate constraint violations. The resulting dispatch has the same security level as the usual security-constrained dispatch, but with lower operating costs. Case studies with the IEEE 118-bus are presented.

• Research Organization: Unicamp, Campinas
• OSTI ID: 6881210
• Journal Information: IEEE Trans. Power Syst.; (United States), Journal Name: IEEE Trans. Power Syst.; (United States) Vol. PWRS-2:1; ISSN ITPSE
• Country of Publication: United States
• Language: English

Related Subjects

20 FOSSIL-FUELED POWER PLANTS
200106 -- Fossil-Fueled Power Plants-- Economics
29 ENERGY PLANNING, POLICY, AND ECONOMY
290100 -- Energy Planning & Policy-- Energy Analysis & Modeling
290200 -- Energy Planning & Policy-- Economics & Sociology
296001* -- Energy Planning & Policy-- Electric Power Generation-- (-1989)
ALGORITHMS
COST
ELECTRIC UTILITIES
EMERGENCY PLANS
ITERATIVE METHODS
LOAD MANAGEMENT
MANAGEMENT
MATHEMATICAL LOGIC
MATHEMATICAL MODELS
OPERATING COST
OUTAGES
POWER GENERATION
POWER PLANTS
PROBABILITY
PUBLIC UTILITIES
SCHEDULES