The authors have considered the problem of optimization of the oil flow taking into account the performance of routine maintenance at an oil transport company. They did present an algorithm for finding the maximum possible oil flow in an oil pipeline in conditions of nonstationary configuration of the oil pipeline network. As a result of the calculations and analysis, the authors did found maximum throughput for oil transportation and have introduced restrictions on the terms of routine maintenance.

Keywords: maximum flow in a network; flow capacity; Ford-Fulkerson algorithm.

References

1. Ford L., Falkerson D. Potoki v setyakh (Flows in Networks), M., Mir, 1966, 277 p.
2. Matematicheskie metody prinyatiya reshenii i setevye modeli v upravlenii i ekonomike (Mathematicak 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.
3. Revyakin A. M., Bardushkina I. V. Matematicheskie metody modelirovaniya v ekonomike (Mathematical Modeling Methods in Economics), M., MIET, 2013, 328 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.
5. Revyakin A. M., Bardushkina I. V., Tereshchenko A. M. Opyt provedeniya interaktivnykh zanyatii po kursu “Metody modelirovaniya ekonomiki” (The Experience in Interactive Lessons of “Economics Modeling Techniques” Course), Ekonomicheskie i sotsial’no-gumanitarnye issledovaniya, 2016, No. 3 (11), pp. 14—20.