Feasible Solution: A feasible solution to a transportation problem is a set of non-negative values xij (i = 1, 2,.., m, j = 1, 2, …n) that satisfies the constraints.
Non-degenerate basic feasible Solution: If a basic feasible solution to a transportation problem contains exactly m + n – 1 allocation in independent positions, it is called a Non-degenerate basic feasible solution. Here m is the number of rows and n is the number of columns in a transportation problem.