This chapter describes the analysis of optimal initial state methods family basics, optimality principles and recursive equation. In this chapter, we define optimal initial state set characteristics and formation principles. Taking into consideration OIS methods’ general characteristics, we offer OIS method’s algorithm, which can be adjusted according to system properties. Also, there is reviewed, the data structure of optimal initial states stored. There are analyzed optimization process characteristics, utilizing OIS methods. There are different researched formation methods of development state steps. For determination of optimization program, optimal initial states set variable, various development states formation algorithms can be used. For example, if development states vectors are binary digits, but development states are formed adding one unit (action), then such algorithm is of considerable drawback—technical system graph formation process is occasional and such algorithm can only be utilized if development actions number is not large. The most effective formation methods of optimal initial states are presented in detail in Chap. 6.
[1]
Stuart E. Dreyfus,et al.
Applied Dynamic Programming
,
1965
.
[2]
Ahmed H. El-Abiad,et al.
Transmission Planning Using Discrete Dynamic Optimizing
,
1973
.
[3]
Esteban Hnyilicza,et al.
Transmission Expansion by Branch-and-Bound Integer Programming with Optimal Cost - Capacity Curves
,
1974
.
[4]
R. Bellman.
Dynamic programming.
,
1957,
Science.
[5]
A. El-Abiad,et al.
Discrete optimization and the planning of electric power networks
,
1973
.