Question

A feasible solution is called a basic feasible solution if the number of non‐negative allocations is
equal

Answer 1

Answer:

this is your problem please mark me as brainliest

Answer 2

Answer:

The given statement is false.

Explanation:

• In a Transportation Problem of Linear Programming, If a feasible transportation problem solution has no more than m+ n-1 non-negative allocations—where m is the number of rows and n is the number of columns—it is considered to be a basic feasible solution.
• If  positive allocations are less  than m + n – 1, the basic feasible solution to a transportation problem with m origins and n destinations is said to be degenerate.
• A (m x n) transportation problem is a non degenerate basic feasible solution if-there are exactly m+n-1 non-negative allocations in total, all of which are located in independent positions.

Hence, from the above discussion we can conclude that, A feasible solution is not a basic feasible solution if the number of non‐negative allocations is equal.

#SPJ2