Optimal power-flow solutions for power system planning
- 1 January 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 60 (1), 64-70
- https://doi.org/10.1109/proc.1972.8558
Abstract
Since the development of sparsity techniques by Tinney, the power-flow program has become an extremely effective and often used tool for planning electric power networks. This program solves for the unknowns--voltages, phase angles, etc.--of a set of simultaneous nonlinear algebraic equations, the ac power-flow equations. The optimum power flow is likely to replace, in due time, the normal power flow in many important planning functions discussed in this paper. A number of mathematical programming techniques have recently been studied to solve the optimum power flow and several small-to-medium sized experimental programs have been written. The generalized reduced gradient (GRG), one of the most elegant nonlinear-programming techniques, is described and it is shown how it can be extended to solve optimum power flows of very high dimension (of the order of several thousand nodes). This extension consists mainly of using sparsity techniques in several of the solution steps of the GRG.Keywords
This publication has 6 references indexed in Scilit:
- Some applications of optimization techniques to power systems problemsProceedings of the IEEE, 1974
- Decomposition of Real and Reactive Power Flows: A Method Suited for On-Line ApplicationsIEEE Transactions on Power Apparatus and Systems, 1972
- Optimal Power Flow SolutionsIEEE Transactions on Power Apparatus and Systems, 1968
- Sensitivity in Power SystemsIEEE Transactions on Power Apparatus and Systems, 1968
- Direct solutions of sparse network equations by optimally ordered triangular factorizationProceedings of the IEEE, 1967
- Efficient matrix techniques applied to transmission tower designProceedings of the IEEE, 1967