Loading…
Decomposition Method for Solving Three-Index Transportation Problems
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 tha...
Saved in:
Published in: | Journal of computer & systems sciences international 2018-09, Vol.57 (5), p.759-765 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 1064-2307 1555-6530 |
DOI: | 10.1134/S1064230718050143 |