MCQ
MCQ
1. The minimal cost network flows are special cases of transportation problems
2. The transportation problems are special cases of the minimal cost network flows
3. There is no difference
4. The transportation problems are formulated in terms of tableaus, while the minimal
2. With the transportation technique, the initial solution can be generated in any fashion one
chooses. The only restriction is that
1. the cost of shipping one unit from each origin to each destination
1. northwest-corner
2. intuitive lowest-cost
3. southeast-corner rule
4. stepping-stone
7. The transportation method assumes that
1. there are no economies of scale if large quantities are shipped from one source to one
destination.
2. table plus the number of columns in the table plus 1.
3. There is only one optimal solution for each problem.
4. the number of dummy sources equals the number of dummy destinations
1. A dummy source and destination must be added if the number of rows plus columns
minus 1 is not equal to the number of filled squares.
2. Only squares containing assigned shipments can be used to trace a path back to an
empty square.
3. An improvement index that is a net positive means that the initial solution can be
improved.
4. Only empty squares can be used to trace a path back to a square containing an
assigned shipment
1. destinations; sources
3. columns; rows
5. warehouses; suppliers
1. Destinations; sources