An algorithm for determining optimal and suboptimal trajectories of the development of a system.

*(Russian, English)*Zbl 1438.90376
Sib. Zh. Ind. Mat. 22, No. 1, 34-40 (2019); translation in J. Appl. Ind. Math. 13, No. 1, 36-42 (2019).

Summary: An algorithm is described for determining the optimal and the entire set of suboptimal trajectories of development of technical and economic systems. The dynamics of the possible development of a system is considered as a directed graph whose nodes characterize the possible system states in the future time intervals, while the arcs represent all possible transitions from one state to another during given time intervals. The algorithm is based on the dynamic programming principles. It is applied in the software package ‘Dynamics’ that realizes the methods of combinatorial modeling to study the long-term options for the development of energy systems.

##### Software:

Dynamics
PDF
BibTeX
XML
Cite

\textit{A. V. Edelev} and \textit{V. I. Zorkal'tsev}, Sib. Zh. Ind. Mat. 22, No. 1, 34--40 (2019; Zbl 1438.90376); translation in J. Appl. Ind. Math. 13, No. 1, 36--42 (2019)

Full Text:
DOI

##### References:

[1] | A. V. Edelev and V. I. Zorkaltsev, “Formation of the DevelopmentOptions for Energy Systems by CombinatorialModelingMethods,” Sibir.Zh. Industr.Mat. 21 (3), 37-49 (2018) [J. Appl. Indust.Math. 12 (3), 442-452 (2018)]. |

[2] | V. I. Zorkaltsev and O. V. Khamisov, Steady-State Models in Economics and Power Engineering (Nauka, Novosibirsk, 2006) [in Russian]. |

[3] | R. Bellman, Dynamic Programming (Princeton University Press, Princeton, 1957; Inostrannaya Literatura, Moscow, 1960). · Zbl 0077.13605 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.