Premium
A synthesis method for power network extension
Author(s) -
Szendy Károly
Publication year - 1973
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.4490010306
Subject(s) - extension (predicate logic) , mathematical optimization , quadratic equation , minification , simple (philosophy) , computer science , function (biology) , power network , linear programming , voltage , power (physics) , mathematics , electric power system , engineering , electrical engineering , philosophy , physics , geometry , epistemology , quantum mechanics , evolutionary biology , biology , programming language
Abstract In this paper the synthesis problem of power‐network extensions will be studied under the assumption that the loads are deterministic. The extended network satisfying conditions on the branch voltage limits will be optimized by the minimization of the network ‘first‐cost’. Useful notions such as network extension impedance and extension coefficient matrices will be introduced to describe the effect of network extensions. Two optimization methods will be presented. In the first one the cost function is linear and the constraints appear in the form of simple fractions. In the second method the cost function is assumed to be quadratic but the constraints are linear. In the latter case the extensible branches have to form a tree. It will be shown that sequential unconstrained optimization techniques can be applied in both cases.