|
Solves combined unit decommitment / optimal power flow.
Solves a combined unit decommitment and optimal power flow for a
single time period. Uses an algorithm similar to dynamic programming. It
proceeds through a sequence of stages, where stage N has
N generators shut down, starting with N=0. In
each stage, it forms a list of candidates (gens at their
Pmin limits) and computes the cost with each one of them
shut down. It selects the least cost case as the starting point for the
next stage, continuing until there are no more candidates to be shut down
or no more improvement can be gained by shutting something down. If
verbose in ppopt (see ppoption is
true, it prints progress info, if it is > 1 it prints the
output of each individual opf.
See Also:
opf, runuopf
- Authors:
-
Ray Zimmerman (PSERC Cornell),
Richard Lincoln
|