Page 228 - Mathematical Models and Algorithms for Power System Optimization

Discrete Optimization for Reactive Power Planning 219

planning in the transmission and distribution system, power equipment operation in the
transmission and distribution system, etc., which may be study topics in the future.

In addition to the algorithm in this chapter, the current algorithms that can be used to solve
discrete optimization problems to some extent include Bound & Branch method, dynamic
programming method, Benders decomposition method, Lagrangian relaxation method, internal
path method, etc.

At present, the simplex method can be used to solve the LP problem with thousands or
even hundreds of thousands of variables, but the accurate-integer programming algorithm can
only solve the optimal solutions of less than 100 variables, because its calculation time varies
with integer variables. Therefore, to solve the discrete optimization problem in the power
system, it is necessary to fully consider the actual physical background of different problems.
This is also of great significance for programming mathematics itself.
Discrete optimization is still a new research area in the power system. There are still many
issues that need further exploration and study. In the future, new algorithms will be developed
on the basis of this research, which will result in the application on other discrete optimization
problems of power systems.