“…The optimization of the transportation problem is posed as below: A search for the solution for the dual version of the problem was attempted since this formulation results in a reduced number of variables (seven) but with increased number of constraints (twelve). The 3 n enumeration algorithm in [46] provides virtually instantly the global optimum (23,25,8,12,7,12,0) with function value of 84000. The primal solution (850,350,0, 0,250,0, 0,750,0, 50,750,0) is readily obtained using the complementary slackness theorem [37,47] that agrees with the reported result found using LP package.…”