This preview shows page 1. Sign up to view the full content.
Unformatted text preview: er in the problem; ‘N − 1’ just means ‘all-but-one’.) This
states that the system can still operate even if any one power line goes out, by re-routing the line
powers. The case when line j goes out is called ‘failure contingency j ’; this corresponds to replacing
Pjmax with 0. The requirement is that there must exist a contingency power ﬂow vector p(j ) that
(j ) satisﬁes all the constraints above, with pj = 0, using the same given generator powers. (This
corresponds to the idea that power ﬂows can be re-routed quickly, but generator power can only
be changed more slowly.) The ‘N − 1 reliability constraint’ requires that for each line, there is a
contingency power ﬂow vector. The ‘N − 1 reliability constraint’ is (implicitly) a constraint on the
The questions below concern the speciﬁc instance of this problem with data given in rel_pwr_flow_data.m.
(Executing this ﬁle will also generate a ﬁgure showing the network you are optimizating.) Especially
for part (b) below, you must explain exactly how you set up the problem as a...
View Full Document
This note was uploaded on 09/10/2013 for the course C 231 taught by Professor F.borrelli during the Fall '13 term at University of California, Berkeley.
- Fall '13
- The Aeneid