With the restriction of water demand and supply, the objective function optimal value was calculated by sequential quadratic programming. 以需水量和可供水量為約束條件，采用序列二次規劃法求解函數最優(yōu)值。
The proposed approach is robust to local minima of the energy functional because it is minimized by dynamic programming method in the whole energy space. 由于采用了動(dòng)態(tài)規劃法并在整個(gè)能量空間中搜索能量泛函的極值，算法對能量泛函的局部極值有較強的魯棒性。
