Skip navigation
Skip navigation

Combinatorial Optimization of AC Optimal Power Flow with Discrete Demands in Radial Networks

Khonji, Majid; Chau, Sid Chi-Kin; Elbassioni, Khaled

Description

The AC Optimal power flow (OPF) problem is one of the most fundamental problems in power systems engineering. For the past decades, researchers have been relying on unproven heuristics to tackle OPF. The hardness of OPF stems from two issues: (1) non-convexity and (2) combinatoric constraints (e.g., discrete power extraction constraints). The recent advances in providing sufficient conditions on the exactness of convex relaxation of OPF can address the issue of non-convexity. To complete the...[Show more]

CollectionsANU Research Publications
Date published: 2019
Type: Journal article
URI: http://hdl.handle.net/1885/307660
Source: IEEE Transactions on Control of Network Systems
DOI: 10.1109/TCNS.2019.2951657

Download

File Description SizeFormat Image
Combinatorial_Optimization_of_AC_Optimal_Power_Flow_With_Discrete_Demands_in_Radial_Networks.pdf1.71 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  17 November 2022/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator