Network Methods for Head-dependent Hydro Power Scheduling
We study short-term planning of hydro power with a nonlinear objective function. Given prices on the power one seeks to maximize the value of the production over a time-horizon. By assuming a bilinear dependency on head and discharged water we prove that the objective varies concavely when one sends flow along cycles. It follows that in each set of points of equal value containing a local optimum, there is an extreme point of the feasible set. This suggests computing stationary points by using a modified minimum cost network flow code. The model also allows us to derive explicit convex lower bounding functions of the objective. We present computational results for a real-sized hydro-power system.
KeywordsLocal Optimum Extreme Point Network Flow Downstream Station Hydro Power
Unable to display preview. Download preview PDF.
- Ahuja R. K., Magnanti T. L., Orlin J. B.: Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Inc., Englewood Cliffs, N. J., 1993Google Scholar
- CPLEX Optimization inc., Nevada: Using the CPLEX callable library, ver. 3.0. 1994.Google Scholar
- Feltenmark S.: CNET — a simplex network flow code written in C. Optimization &Systems Theory, Department of Mathematics, 1995Google Scholar
- Ryoo H. S. and Sahinidis N. V.: A branch-and-reduce approach to global optimization. Obtained via ftp, 1995Google Scholar
- Wood A. J., Wollenburg B. F.: Power Generation, Operation and Control. John Wiley & Sons, ISBN 0-471-09182-0, 1984Google Scholar