Abstract
In the present paper a fixed charge bi-criterion transportation problem, wherein there is a restriction on the total flow, is studied. An algorithm to find the efficient cost-time trade off pairs in a fixed charge bi-criterion transportation problem with restricted flow is presented. A related fixed charge bi-criterion transportation problem is formulated and the efficient cost-time trade off pairs to the given problem are shown to be derivable from this related problem.