Basic Feasible Solution | Transportation Model/Problem | Operation Research

A feasible solution which contains ($m + n - 1$) non-negative allocations is called basic feasible solution, where '$m$' is number of rows and '$n$' is number of columns.