Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow
From MaRDI portal
Publication:2917622
DOI10.1287/opre.1110.1036zbMath1251.90308OpenAlexW2154890268MaRDI QIDQ2917622
Publication date: 1 October 2012
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/70f16cbc657981a26bf4361a574f6893c6e76bdd
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, On the determination of European day ahead electricity prices: the Turkish case, Active network management for electrical distribution systems: problem formulation, benchmark, and approximate solution, Sustainable operations, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Convex quadratic relaxations for mixed-integer nonlinear programs in power systems, Matrix minor reformulation and SOCP-based spatial branch-and-cut method for the AC optimal power flow problem, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, Two-stage stochastic optimization for optimal power flow under renewable generation uncertainty, A survey on conic relaxations of optimal power flow problem, Strong NP-hardness of AC power flows feasibility
Uses Software
