摘要: The common linear optimal power flow (LOPF) formulation that underlies most transmission expansion planning (TEP) formulations uses bus voltage angles as auxiliary optimization variables to describe Kirchhoff's law. As well introducing a large number of variables, the angle-based has disadvantage it is not well-suited considering connection multiple disconnected networks. It is, however, possible circumvent these and reduce required constraints by expressing law directly in terms flows, based on cycle decomposition network graph. For generation capacity with multi-period LOPF, this equivalent reformulation was shown solving times an order magnitude. Allowing line be co-optimized discrete TEP problem makes non-convex mixed-integer problem. This paper develops novel cycle-based for LOPF compares standard formulation. combinatorics networks formalized both formulations, topic which received attention literature. conveniently accommodate synchronization options. Since use big-M disjunctive relaxation, useful derivations suitable values are provided. competing benchmarked realistic model European system at varying spatial temporal resolutions. solves up 31 faster particular cases, while averaging speed-up factor 4.