 In other words, each mine "m" ∈ "M" supplies precisely one factory "T"("m") ∈ "F" and each factory is supplied by precisely one mine.We wish to find the "optimal transport plan", the plan "T" whose "total cost"

is the least of all possible transport plans from "M" to "F".This motivating special case of the transportation problem is an instance of the assignment problem.