The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point wit...The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane （IP/CP） method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender＇s decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm.展开更多
文摘The generation expansion planning is one of complex mixed-integer optimization problems, which involves a large number of continuous or discrete decision variables and constraints. In this paper, an interior point with cutting plane （IP/CP） method is proposed to solve the mixed-integer optimization problem of the electrical power generation expansion planning. The IP/CP method could improve the overall efficiency of the solution and reduce the computational time. Proposed method is combined with the Bender＇s decomposition technique in order to decompose the generation expansion problem into a master investment problem and a slave operational problem. The numerical example is presented to compare with the effectiveness of the proposed algorithm.
