J Austral Math Soc Ser B 35 pp498--505, 1994.
(Received 18 September 1990; revised 18 December 1992)
The 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.
Last Modified: Wed Sep 21 9:32:46 2005