A network flow algorithm for hydrothermal scheduling

This paper presents a new primal-dual algorithm, which is capable of solving nonlinear network flow problem with convex separable cost. One of the main characteristics of the algorithm is that it can begin with any circulation, feasible or not, provided that node conservation conditions are satisfied. Furthermore, this paper introduces how to apply the algorithm to solve hydrothermal scheduling problems. Tests on the thermal subsystem with fixed energy plants have been performed. Results have demonstrated the high efficiency of the code