Email this article Decomposition Method for Solving Three-Index Transportation Problems
- Authors: Wang L.P.1, Esenkov A.S.2, Tizik A.P.2, Torchinskaya E.V.3
-
Affiliations:
- Nanjing University of Aeronautics and Astronautics
- Computer Science and Control Federal Research Center
- Moscow Institute of Physics and Technology (State University)
- Issue: Vol 57, No 5 (2018)
- Pages: 759-765
- Section: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/220211
- DOI: https://doi.org/10.1134/S1064230718050143
- ID: 220211
Cite item
Open Access
Access granted
Subscription Access
Abstract
A decomposition method based on the sequential modification of the optimality criterion is used for solving the classical three-index transportation problem. The method consists of a sequence of solutions of local problems with three constraints. A monotonic (in the optimality criterion) process that converges to the solution of the original problem is constructed. The solutions of the transportation problem with a linear and quadratic objective function are considered and the numerical results are presented.
About the authors
L. P. Wang
Nanjing University of Aeronautics and Astronautics
Email: tizik_ap@mail.ru
China, Nanjing, 210016
A. S. Esenkov
Computer Science and Control Federal Research Center
Email: tizik_ap@mail.ru
Russian Federation, Moscow, 119333
A. P. Tizik
Computer Science and Control Federal Research Center
Author for correspondence.
Email: tizik_ap@mail.ru
Russian Federation, Moscow, 119333
E. V. Torchinskaya
Moscow Institute of Physics and Technology (State University)
Email: tizik_ap@mail.ru
Russian Federation, Dolgoprudny, Moscow oblast, 141701
