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