期刊名称：Naukovij Vìsnik Nacìonalʹnoï Akademìï Statistiki, Oblìku ta Auditu
印刷版ISSN：2520-6834
电子版ISSN：2521-1323
出版年度：2017
期号：4
页码：87-92
DOI：10.31767/nasoa.4.2017.11
出版社：National Academy of Statistics, Accounting and Audit
摘要：В работе предложено расширение алгоритма сформулированной обобщенной математической задачи распределения взаимосвязанных ресурсов для поиска глобального экстремума.↓У роботі запропоновано розширення алгоритму сформульованої узагальненої математичної задачі розподілу взаємопов ’язаних ресурсів для пошуку глобального екстремуму.
其他摘要：Methods for solving the problems o f resource allocation occupy an important place among the mathematical methods for solving special problems in making decisions for the preparation and conduct o f the operation. With the emergence o f a new kind o f resource - information, the characteristic feature o f which is internal interconnection, distribution problems acquire a new meaning. The purpose o f the study is to offer an extension o f the algorithm for searching a local extremum to achieve a global extremum in solving the distribution problems o f connected resources. To achieve global extremum, we use the well-known approach: 1. Generate some initial distribution; 2. We improve it by searching for the local extremum using a special method. 3. After the n-fold execution o f the first two steps, the obtained values are compared and the best one is selected and accepted as the value of the global extremum. The essence o f the approach proposed in the work is to use as the initial breakdown of «natural» entities on a graph model, which is used in the physical interpretations o f the solvable problems o f the distribution o f connected resources. The description o f the graph proposed in the work gives the possibility to obtain the natural initial conditions for organizing the search for a global extremum in the problem o f the distribution o f connected resources.
关键词：алгоритм; пов ’язані ресурси; розподіл ресурсів; глобапьний екстремум
