True (T) or False (?)? Page 7 1.- A transportation problem can always be represented by a balanced model. A transportation model that is initially unbalanced say require the addition of both a dumny source and a dummy destination to effect balancing. In the solution of the transportation model, the amounts shipped from a dussy source to the destinations actually represent shortages at the destinations. the transportation model is restricted to dealing with a single commodity only. A basic requirement for using the transportation technique is that the transportation model be balanced. The transportation technique essentially uses the same steps of the simplex method. It the same starting basic solution is used in both the simplex method and the transportation techniques, the iterations in the two procedures will essentially reproduce one another. In the transportation technique, the closed-loop method for determining the leaving variable is basically different from applying the feasibility condition in the simplex method. The multipliers in the transportation technique are essentially the dual variables of the LP representing the transportation problem. The arbitrary selection of the value of one of the multipliers in a transportation iteration will lead to the determination of different entering variables. If a constant value is added to every cost element cu in the transportation tableau, the optimal values of the variables x. will change. A balanced transportation model may not have any feasible solution. Every basic solution in the assignment problem is necessarily degenerate. The assignment problem can be solved by the transportation technique. ICC in the transportation model is the lowest unit cost between source i and destination j, both the transportation model and its associated transshipment model will produce the same optimum solution. Determination of the lowest c, in a transportation model may generally require the use of a special algorithm such as the shortest-route technique. The use of transshipping makes it unnecessary to obtain the lowest between source i and destination for the purpose of determining the minimum-cost transportation schedule between the sources and destinations