Abstract
The optimum allocation of resources for a Gale problem of supply and demand with uncertain factors is considered. The Dantzig-Wolfe decomposition and the generalized potential method developed earlier by the author for a deterministic version of the problem are used to construct and validate the algorithm for a numerical solution.
Similar content being viewed by others
References
O. A. Kosorukov, “About one algorithm of linear synthesis of communication networks,” in System Programming and Optimization Issues (Mosk. Gos. Univ., Moscow, 1987), pp. 174–180 [in Russian].
D. Gale, The Theory of Linear Economic Models (McGraw-Hill, New York, 1960).
E. G. Davydov, Games, Graphs, Resources (Radio Svyaz’, Moscow, 1981) [in Russian].
V. I. Tsurkov, Decomposition in Problems of Large Dimension (Nauka, Moscow, 1981) [in Russian].
R. Busacker and T. Saati, Finite Graphs and Networks: An Introduction with Applications (McGraw-Hill, New York, 1965).
O. A. Kosorukov and E. G. Davydov, “Some questions of nonlinear synthesis of communication networks,” Vestn. Mosk. Univ., Ser. 15: Vychisl. Mat. Kibern., No. 2, 31–36 (1986).
Author information
Authors and Affiliations
Corresponding author
Additional information
Russian Text © The Author(s), 2019, published in Vestnik Moskovskogo Universiteta, Seriya 15: Vychislitel’naya Matematika i Kibernetika, 2019, No. 2, pp. 28–33.
About this article
Cite this article
Kosorukov, O.A. Algorithm of the Method of Generalized Potentials for Problems of the Optimum Synthesis of Communication Networks with Undefined Factors. MoscowUniv.Comput.Math.Cybern. 43, 138–142 (2019). https://doi.org/10.3103/S0278641918040040
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641918040040