This paper presents a branching method for the solution of the fixed charge transportation problem. Starting with a linear formulation of the problem, we develop the method which converges to the optimal solution. The method is based on the computation of a lower bound and an upper bound...

In this paper we present a new approximation for computing lower bound for the fixed charge transportation problem (FCTP). The lower bounds thus generated delivered 87% optimal solutions for 56 randomly generated small, up to 6×10 in size, problems in an experimental design. For somewhat...

In a transportation problem, is it possible to find a solution with less (or equal) cost than the optimal solution by shipping more units under the condition that at least the same amount is shipped from each supply point and to each market? This more-for-less analysis could be useful for...