ABSTRACT
In the standard classical transportation problem, a commodity is to be transported from each of sources to each of destinations. Bandopadhyaya and Puri discussed the impaired flow multi-index transportation problem with axial constraints. Sometimes, when one wishes to keep reserve stocks at the sources for emergencies, thereby restricting the total transportation flow to a known specified level, it results in a transportation problem with impaired flow. In the present paper the authors develop a method to find an optimal basic feasible solution of a three-dimensional transportation problem with axial constraints having restricted flow. Also, the authors show that the optimal basic feasible solution obtained by our method is betterthan the existing Bandopadhyaya and Puri algorithm. The solution method is very simple from a computational point of view and is easy to understand.
