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