Article ID: | iaor19931548 |
Country: | United States |
Volume: | 39 |
Issue: | 6 |
Start Page Number: | 955 |
End Page Number: | 960 |
Publication Date: | Nov 1991 |
Journal: | Operations Research |
Authors: | Adler I., Cosares S. |
Keywords: | computational analysis |
The authors extend the list of linear programming problems that are known to be solvable in strongly polynomial time to include a class of LPs which contains special cases of the generalized transshipment problem. The result is facilitated by exploiting some special properties associated with Leontief substitution systems and observing that a feasible solution to the system,