The authors consider the problem of cost minimization for a firm producing communication devices, namely minimization of haul costs while transporting communication devices to trade centers. The authors have presented algorithms for finding the optimal placement of additional warehouse and repair shop in one of pick-up points. Computationally it is proposed to extend the head warehouse and to rent a room for the realization of repair works in manufacturing firm’s building.

Keywords: cost minimization; shortest path; communication; Dijkstra’ algorithm; Floyd’s algorithm; Ford’s algorithm; shortest-distance matrix.

References

1. Matematicheskie metody prinyatiya reshenii i setevye modeli v upravlenii i ekonomike (Mathematical Methods of Decision Making and Network Models in Administration and Economics), I. N. Abanina , V. V. Bardushkin, I. V. Bardushkina i dr., pod obshch. red. I. N. Abaninoi, A. M. Revyakina, M., ITs MGADA, 2014, 176 p.
2. Revyakin A. M., Bardushkina I. V. Matematicheskie metody modelirovaniya v ekonomike (Mathematical Modeling Methods in Economics), M., MIET, 2013, 328 p.
3. Revyakin A. M., Bardushkina I. V., Tereshchenko A. M. Matematicheskie metody i modeli v issledovanii operatsii (Mathematical Methods and Models in Operational Research), M., ITs MGADA, 2013, 264 p.
4. Isachenko A. N., Revyakin A. M. Matroidy v matematicheskom modelirovanii ekonomicheskikh sistem (Matroids in Mathematical Modeling of Economic Systems), Ekonomicheskie i sotsial’no-gumanitarnye issledovaniya, 2015, No. 1 (5), pp. 13—18.