Optimal daily scheduling of cascaded plants using a new algorithmof nonlinear minimum cost network flow |
| |
| Authors: | Xia Qing Xiang Niande Wang Shiying Zhang Boming Huang Mei |
| |
| Affiliation: | Dept. of Electr. Eng., Tsinghua Univ., Beijing ; |
| |
| Abstract: | An optimality condition theorem and an algorithm for nonlinear minimum-cost network flow are proposed. A computational network model for optimal daily scheduling of cascaded plants (ODSCP) is established, and an algorithm for searching the minimum-cost flow-augmenting path and the maximum-cost flow-reducing path in the computational network model of ODSCP is described. Digital computations are carried out and the results show that the proposed method is very fast compared to existing methods |
| |
| Keywords: | |
|
