Cost-time trade-off in three-axial sums' transportation problem

Abstract

AbstractThe bi-objective Cost-time Trade-off Three Axial Sums' Transportation Problem is shown to be equivalent to a single-objective standard Three Axial Sums' problem, which can be solved easily by the existing efficient methods. The equivalence is established for some specially defined solutions termed as Lexicographic optimal solutions with minimum pipe-line.