The Transportation Problem with two admissible cells in each column

0.00 Avg rating—0 Votes

Article ID:	iaor19891131
Country:	India
Volume:	5
Issue:	3
Start Page Number:	153
End Page Number:	159
Publication Date:	Dec 1989
Journal:	International Journal of Management and Systems
Authors:	Szwarc Wlodzimierz, Intrator Jacob
Keywords:	programming: linear

Abstract:

This paper considers an m×n Transportation Problem with two admissible cells in each column. The developed properties considerably simplify the simplex solution procedure. This procedure terminates after at most n-m+1 iterations for a special case of this model.

Reviews

Required fields are marked *. Your email address will not be published.