Email this article Decomposition Algorithm for the Linear Three-Index Transportation Problem
- Authors: Wang L.P.1, Tizik A.P.2, Tsurkov V.I.3
-
Affiliations:
- Nanjing University of Aeronautics and Astronautics
- Central Research Institute of Communication
- Federal Research Center for Information Science and Control, Russian Academy of Sciences
- Issue: Vol 58, No 6 (2019)
- Pages: 883-888
- Section: Computer Methods
- URL: https://journals.rcsi.science/1064-2307/article/view/220529
- DOI: https://doi.org/10.1134/S1064230719060157
- ID: 220529
Cite item
Open Access
Access granted
Subscription Access
Abstract
The method of sequential modification of an objective function, which was earlier used for the classical transportation problem, is extended to the case of three indices. In the iterative process, the problem with three constraints and one binding variable is solved. Then, three independent problems with one constraint in which the coefficients for the binding variable are changed are considered. Using the suggested algorithm, a sequence of pseudosolutions with a monotonic growth of the objective function that converges to the optimum is constructed. The degeneracies are analyzed.
About the authors
L. P. Wang
Nanjing University of Aeronautics and Astronautics
Author for correspondence.
Email: wlpmath@nuaa.edu.cn
China, Nanjing, 211100
A. P. Tizik
Central Research Institute of Communication
Author for correspondence.
Email: tizik_ap@mail.ru
Russian Federation, Moscow, 111141
V. I. Tsurkov
Federal Research Center for Information Science and Control, Russian Academy of Sciences
Author for correspondence.
Email: tsur@ccas.ru
Russian Federation, Moscow, 119333
