Premium
The cyclic method of solving the transshipment problem with an additional linear constraint
Author(s) -
Masch Victor V.
Publication year - 1980
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230100103
Subject(s) - simplex algorithm , mathematical optimization , transshipment (information security) , constraint (computer aided design) , computer science , linear programming , integer programming , scheme (mathematics) , simplex , dual (grammatical number) , property (philosophy) , mathematics , algorithm , combinatorics , epistemology , art , mathematical analysis , philosophy , geometry , computer security , literature
The “cyclic” method proposed in this paper provides a more efficient computational scheme than currently known adaptations of the simplex method for solving the transshipment problem with an additional linear constraint. Computer codes for the pure network problem can be easily altered to accommodate the cyclic method. Even more important, the cyclic method produces integral solutions at all iterations (except, possibly, the last one); this property may prove valuable in integer programming.