Title page for ETD etd-0430103-152758

Document Type thesis

Author Name Pajic, Slobodan

URN etd-0430103-152758

Title Sequential Quadratic Programming-Based Contingency Constrained Optimal Power Flow

Degree MS

Department Electrical & Computer Engineering

Advisors
Kevin A. Clements, Advisor
Alexander E. Emanuel, Committee Member
Paul W. Davis, Committee Member

Keywords
contingency
interior point method
optimal power flow

Date of Presentation/Defense 2003-04-29

Availability unrestricted

Abstract
The focus of this thesis is formulation and development of a mathematical framework
for the solution of the contingency constrained optimal power flow (OPF) based on
sequential quadratic programming. The contingency constrained optimal power flow
minimizes the total cost of a base case operating state as well as the expected cost of
recovery from contingencies such as line or generation outages. The sequential quadratic
programming (SCP) OPF formulation has been expanded in order to recognize
contingency conditions and the problem is solved as a single entity by an efficient interior
point method. The new formulation takes into account the system corrective capabilities
in response to contingencies introduced through ramp-rate constraints. Contingency
constrained OPF is a very challenging problem, because each contingency considered
introduces a new problem as large as the base case problem. By proper system reduction
and benefits of constraint relaxation (active set) methods, in which transmission
constraints are not introduced until they are violated, the size of the system can be
reduced significantly Therefore, restricting our attention to the active set constraint set
makes this large problem significantly smaller and computationally feasible.

Files
THESIS.pdf

Browse by Author | Browse by Department | Search all available ETDs

Questions? Email etd-questions@wpi.edu
Maintained by webmaster@wpi.edu

Document Type	thesis
Author Name	Pajic, Slobodan
URN	etd-0430103-152758
Title	Sequential Quadratic Programming-Based Contingency Constrained Optimal Power Flow
Degree	MS
Department	Electrical & Computer Engineering
Advisors	Kevin A. Clements, Advisor Alexander E. Emanuel, Committee Member Paul W. Davis, Committee Member
Keywords	contingency interior point method optimal power flow
Date of Presentation/Defense	2003-04-29
Availability	unrestricted
Abstract The focus of this thesis is formulation and development of a mathematical framework for the solution of the contingency constrained optimal power flow (OPF) based on sequential quadratic programming. The contingency constrained optimal power flow minimizes the total cost of a base case operating state as well as the expected cost of recovery from contingencies such as line or generation outages. The sequential quadratic programming (SCP) OPF formulation has been expanded in order to recognize contingency conditions and the problem is solved as a single entity by an efficient interior point method. The new formulation takes into account the system corrective capabilities in response to contingencies introduced through ramp-rate constraints. Contingency constrained OPF is a very challenging problem, because each contingency considered introduces a new problem as large as the base case problem. By proper system reduction and benefits of constraint relaxation (active set) methods, in which transmission constraints are not introduced until they are violated, the size of the system can be reduced significantly Therefore, restricting our attention to the active set constraint set makes this large problem significantly smaller and computationally feasible.
Files	THESIS.pdf