The adapted algorithm of Jose A. Diaz for multi-criteria fractional transportation problem with ”bottleneck” criterion

Abstract

The paper proposes an adapted version of Jose A. Diaz algorithm for solving the multi-criteria fractional transportation problem with the same bottleneck denominators, additionally with the same time ”bottleneck” criterion separately. It generates for each (feasible) time value the best compromise multi criteria solution. So, finally, we will obtain one finite set of efficient solutions for solving the multi-criteria fractional transportation problem with the same bottleneck denominators, separately including the time ”bottleneck” criterion.