Mathematical decomposition techniques for power system expansion planning: Volume 4, Security-constrained optimal power flow with postcontingency corrective rescheduling: Final report

Technical Report · Mon Feb 01 04:00:00 EST 1988

OSTI ID:5433441

Granville, S; Pereira, M V.F.; Dantzig, G B; Avi-Itzhak, B; Avriel, M; Monticelli, A

This volume describes a mathematical framework for the solution of the security-constrained dispatch that can take into account the system rescheduling capabilities. The methodology is based on mathematical programming decomposition techniques that allow the iterative solution of a ''base-case'' economic dispatch and separate contingency analysis with generating rescheduling to eliminate constraint violations. The preventive control actions are implemented from linear constraints, known as feasibility cuts, that are generated on the contingency analysis and sent to the economic dispatch problem. 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 system are presented and discussed. Further extensions of the methodology to include other corrective schemes and probabilistic aspects are also discussed. 13 refs., 8 figs., 13 tabs.

• Research Organization: Stanford Univ., CA (USA). Dept. of Operations Research
• OSTI ID: 5433441
• Report Number(s): EPRI-EL-5299-Vol.4; ON: TI88920205
• Country of Publication: United States
• Language: English

Related Subjects

20 FOSSIL-FUELED POWER PLANTS
200100 -- Fossil-Fueled Power Plants-- Power Plants & Power Generation
200301* -- Power Transmission & Distribution-- AC Systems
EHV & UHV-- (-1989)
24 POWER TRANSMISSION AND DISTRIBUTION
29 ENERGY PLANNING, POLICY, AND ECONOMY
296000 -- Energy Planning & Policy-- Electric Power
DOCUMENT TYPES
MATHEMATICAL MODELS
OPTIMIZATION
PLANNING
POWER GENERATION
POWER TRANSMISSION
PROGRESS REPORT
RELIABILITY