Summary

Summary

·           In a transportation problem if the total supply equals the total demand, it is said to be balanced transportation problem. Otherwise it is said to be unbalanced transportation problem

·           Feasible Solution: A feasible solution to a transportation problem is a set of non-negative values x_ij(i=1,2,..,m, j=1,2,…n) that satisfies the constraints.

·           Basic Feasible Solution: A feasible solution is called a basic feasible solution if it contains not more than m+n-1 allocations, where m is the number of rows and n is the number of columns in a transportation table.

·           Optimal Solution: Optimal Solution is a feasible solution (not necessarily basic) which optimizes(minimize) the total transportation cost.

·           Non degenerate basic feasible Solution: If a basic feasible solution to a transportation problem contains exactly m+n-1 allocations in independent positions, it is called a Non degenerate basic feasible solution.

·           Degeneracy : If : If a basic feasible solution to a transportation problem contains less than m+n-1 allocations , it is called a degenerate basic feasible solution.

·           In an assignment problems number of rows and columns must be equal

·           The optimum assignment schedule remains unaltered if we add or subtract a constant from all the elements of the row or column of the assignment cost matrix.

·           If for an assignment problem all Cij > 0 then an assignment schedule (x_ij) which satisfies ∑C_ij x_ij = 0 must be optimal.