02572oam 2200457zu 450 991013919830332120241212215852.097814244774631424477468(CKB)2560000000059166(SSID)ssj0000527409(PQKBManifestationID)12208038(PQKBTitleCode)TC0000527409(PQKBWorkID)10526376(PQKB)10296547(NjHacI)992560000000059166(EXLCZ)99256000000005916620160829d2010 uy engur|||||||||||txtccr2010 49th IEEE Conference on Decision and Control[Place of publication not identified]IEEE20101 online resource illustrationsBibliographic Level Mode of Issuance: Monograph9781424477456 142447745X This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonlinear, heuristic, or local search algorithms to find the minimum power loss, which make them blind to the network topology. Given certain constraints on power level, bus voltages, etc., a linear-matrix-inequality (LMI) optimization problem is derived, which provides a lower bound on the minimum active loss in the network. The proposed LMI problem has the property that its objective function depends on the loads and its matrix inequality constraint is related to the topology of the power system. This property makes it possible to address many important power problems, such as the optimal network reconfiguration and the optimal placement/sizing of distributed generation units in power systems. Moreover, a condition is provided under which the solution of the given LMI problem is guaranteed to be exactly equal to the minimum power loss. As justified mathematically and verified on IEEE test systems, this condition is expected to hold widely in practice, implying that a practical power loss minimization problem is likely to be solvable using a convex algorithm.Adaptive control systemsCongressesAutomatic controlCongressesAdaptive control systemsAutomatic control629.836ieeePQKBPROCEEDING99101391983033212010 49th IEEE Conference on Decision and Control2525491UNINA