![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
Abstract
Tasks of programming on transporting networks have generally a large number of variables and it is knonw, that many of these problems appear in practice.
Therefore it is a good idea to look for speical methods and algorithms.
It has turned out, that linear multi-commodity-flow problems can be substituted and solved by a sequence of smaller problems.
In the solution of the called problems we work with basic solutions and prove some properties of them. We get a suitable test of optimality by using the set of complementary slackness and considering the attached dual problem. At last an algorithm is proposed.