This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the reactive power planning in electric energy systems. The Benders decomposition separates the planning problem into two subproblems: an investment subproblem (master) and the operation subproblem (slave), which are solved alternately. The operation subproblem is solved using a successive linear programming (SLP) algorithm while the investment subproblem, which is an integer linear programming (ILP) problem with discrete variables, is resolved using a Branch and Bound algorithm especially developed to resolve this type of problem
This paper presents a new and efficient methodology for distribution network reconfiguration integra...
This work proposes the inclusion of dynamic constraints in the Optimal Power Flow (OPF) formulation,...
This paper presents a Benders decomposition approach to determine the optimal day-ahead power schedu...
This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the r...
This study proposes the use of a non-linear branch-and-bound (B&B) algorithm to solve the reactive p...
This paper presents a Branch and Bound algorithm to solve the planning problem of the electrical ene...
For most huge systems, planning is a very important step to adapt them for future excepted changes. ...
This paper proposes a Benders' decomposition approach for the large-scale Energy Resource Management...
Este trabalho propõe o desenvolvimento de uma nova abordagem para a resolução do problema de planeja...
Neste trabalho, propõe-se um algoritmo Branch and Bound não linear para resolver o problema de plane...
This paper presents an application of Benders decomposition to deal with the complexities in the sim...
This paper proposes a Benders’ decomposition approach for the large-scale Energy Resource Managemen...
The emergence of a great number of regional planning projects worldwide has considerably increased t...
This paper studies the application of an accelerated Benders decomposition algorithm using local bra...
ABSTRACT. In an electric power systems planning framework, decomposition techniques are usually ap-p...
This paper presents a new and efficient methodology for distribution network reconfiguration integra...
This work proposes the inclusion of dynamic constraints in the Optimal Power Flow (OPF) formulation,...
This paper presents a Benders decomposition approach to determine the optimal day-ahead power schedu...
This paper presents the Benders decomposition technique and Branch and Bound algorithm used in the r...
This study proposes the use of a non-linear branch-and-bound (B&B) algorithm to solve the reactive p...
This paper presents a Branch and Bound algorithm to solve the planning problem of the electrical ene...
For most huge systems, planning is a very important step to adapt them for future excepted changes. ...
This paper proposes a Benders' decomposition approach for the large-scale Energy Resource Management...
Este trabalho propõe o desenvolvimento de uma nova abordagem para a resolução do problema de planeja...
Neste trabalho, propõe-se um algoritmo Branch and Bound não linear para resolver o problema de plane...
This paper presents an application of Benders decomposition to deal with the complexities in the sim...
This paper proposes a Benders’ decomposition approach for the large-scale Energy Resource Managemen...
The emergence of a great number of regional planning projects worldwide has considerably increased t...
This paper studies the application of an accelerated Benders decomposition algorithm using local bra...
ABSTRACT. In an electric power systems planning framework, decomposition techniques are usually ap-p...
This paper presents a new and efficient methodology for distribution network reconfiguration integra...
This work proposes the inclusion of dynamic constraints in the Optimal Power Flow (OPF) formulation,...
This paper presents a Benders decomposition approach to determine the optimal day-ahead power schedu...