Optimization Models and Algorithms for Network Problems of Resours’ Distribution

Валентина Михайлівна Александрова, Олена Євстафіївна Кірік


The efficient algorithms for nonlinear programming problems for calculating networks have been offered, as well as the new network models to determine the optimal flows and distribution of resources have been constructed. The problems with nonlinear objective functions of general form and network structure of restrictions, which allow reaching quite a wide range of networks using common approach, were considered. For calculations the modifications of well-known methods of nonlinear programming were applied. The proposed methods of the first order is comparable by convergence rate with the methods of sequential quadratic programming through an efficient algorithm for the solution of the auxiliary quadratic problems and convenient procedure of step factor calculation. A series of models of resource distribution problems, taking into account the customers’ orders, the variable performance of sources and temporary storage of the product, was analyzed and numerically tested. The comparison of calculation results of applied problems using a standard package Solver and a specially designed computer program by the method of linearization of B.M. Pshenichniy demonstrated the possibility of reducing the number of iterations in the procedures of the same order by several times. The constructed models and algorithms of optimization of flow distribution allow creating effective information-analytical system for optimum control of functioning of the network distribution systems.


Problems of flow distribution; Network models; Methods of nonlinear programming; Optimization algorithms


M.C. Biggs, “Constrained Minimization Using Recursive Quadratic Programming”, Towards Global Optimization, L.C.W. Dixon and G.P. Szergo, Eds. North-Holland, 1975, pp. 341–349.

S.P. Han, “A Globally Convergent Method for Nonlinear Programming”, J. Optimization Theory and Applications, vol. 22, p. 297, 1977.

M.J.D. Powell, Variable Metric Methods for Constrained Optimization. Mathematical Programming: The State of the Art, A. Bachem et al., Eds. Springer Verlag, 1983, pp. 288–311.

Пшеничный Б.Н. Метод линеаризации. – М.: Наука, 1983. – 136 с.

Кірік О.Є. Алгоритми лінеаризації та спряжених градієнтів для нелінійних задач розподілу потоків // Наукові вісті НТУУ “КПІ”. – 2007. – № 3. – С. 67–73.

D. Goldfarb and A. Idnani, “A numerically stable dual method for solving strictly convex quadratic problem”, Math. Progr., vol. 27, no. 1, pp. 1–33, 1983.

Александрова В.М., Соболенко Л.А. Эффективная реализация ускоренного метода решения вариационных неравенств // Системні дослідження та інформ. технології. – 2014. – № 3. – С. 119–129.

Кірік О.Є. Нелінійні задачі розподілу потоків у мережах з фіксованими та вільними вузловими параметрами // Там же. – 2002. – № 4. – С. 106–119.

GOST Style Citations

Copyright (c) 2017 NTUU KPI