Decomposition Algorithm for the Linear Three-Index Transportation Problem
- Авторлар: Wang L.1, Tizik A.2, Tsurkov V.3
-
Мекемелер:
- Nanjing University of Aeronautics and Astronautics
- Central Research Institute of Communication
- Federal Research Center for Information Science and Control, Russian Academy of Sciences
- Шығарылым: Том 58, № 6 (2019)
- Беттер: 883-888
- Бөлім: Computer Methods
- URL: https://journals.rcsi.science/1064-2307/article/view/220529
- DOI: https://doi.org/10.1134/S1064230719060157
- ID: 220529
Дәйексөз келтіру
Аннотация
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.
Авторлар туралы
L. Wang
Nanjing University of Aeronautics and Astronautics
Хат алмасуға жауапты Автор.
Email: wlpmath@nuaa.edu.cn
ҚХР, Nanjing, 211100
A. Tizik
Central Research Institute of Communication
Хат алмасуға жауапты Автор.
Email: tizik_ap@mail.ru
Ресей, Moscow, 111141
V. Tsurkov
Federal Research Center for Information Science and Control, Russian Academy of Sciences
Хат алмасуға жауапты Автор.
Email: tsur@ccas.ru
Ресей, Moscow, 119333