Lagrangian Duality and Branch-and-Bound Algorithms for Optimal Power Flow.
Dzung T. PhanPublished in: Oper. Res. (2012)
Keyphrases
- optimal power flow
- branch and bound algorithm
- duality gap
- set covering problem
- lagrangian relaxation
- optimal solution
- lower bound
- branch and bound
- power system
- linear programming
- np hard
- upper bound
- set covering
- combinatorial optimization
- integer programming
- column generation
- finding an optimal solution
- objective function
- metaheuristic
- load flow
- search algorithm
- mixed integer
- linear program
- search space
- artificial neural networks