수리계획법에 의한 대형시스템의 최적운용 앨고리즘

Algorithm for optimum operation of large-scale systems by the mathematical programming

New algorithms are derived for nonlinear programming problems which are characterized by their large variables and equality and inequality constraints. The algorithms are based upon the introduction of the Dependent-Variable-Elimination method, Independent-Variable-Reduction method, Optimally-Ordered-Triangular-Factorization method, Equality-Inequality-Sequential-Satisfaction method, etc. For a case study problem relating to the optimal determination of load flow in a 10-bus, 13-line sample power system, several approaches are undertaken, such as SUMT, Lagrange's Multiplier method, sequential applications of linear and quadratic programming method. For applying the linear programming method, the conventional simplex algorithm is modified to the large-system-oriented one by the introduction of the Two-Phase method and Variable-Upper-Bounding method, thus resulting in remarkable savings in memory requirements and computing time. The case study shows the validity and effectivity of the algorithms presented herein.