IEEE Transactions on Power Apparatus and Systems · 1984 · 945 citations · 13 references
Natural SciencesElectrical EngineeringMathematicsOptimizationNetwork Flow AlgorithmsNetwork FlowsNonlinear ProgrammingOptimal ControlPower OptimizationNewton ConvergenceNewton-euler DynamicsPower Flow AnalysisPower Network OptimizationPower System Optimization
The classical optimal power flow problem with a nonseparable objective function can be solved by an explicit Newton approach. Efficient, robust solutions can be obtained for problems of any practical size or kind. Solution effort is approximately proportional to network size, and is relatively independent of the number of controls or binding inequalities. The key idea is a direct simultaneous solution for all of the unknowns in the Lagrangian function on each iteration. Each iteration minimizes a quadratic approximation of the Lagrangian. For any given set of binding constraints the process converges to the Kuhn-Tucker conditions in a few iterations. The challenge in algorithm development is to efficiently identify the binding inequalities.
13
Reuven R. Levary · European Journal of Operational Research · 1982 · 4.2K citations
B. Stott, O. Alsaç · IEEE Transactions on Power Apparatus and Systems · 1974 · 1.5K citations