Reference no: EM132226819

1. Any shortest path problem can be modeled as a transshipment problem by:

a. Assigning a supply of 1 to the starting node, a demand of 1 to the ending node, and a demand of 0 to all other nodes in the network.  

b. Forcing the net flow on all arcs to be equal to +1.  

c. Forcing the net flow on all arcs to be equal to -1.  

d. This cannot be done because the shortest path problem is more general than the transshipment problem.

2. A transportation problem:

a. Is complex and requires solver support to find an optimal solution.  

b. Contains no nonpositive slacks.  

c. Is a special case of transshipment problem.  

d. Contains no nonnegative slacks.

3. Suppose you want to find the minimum shipping cost using a transportation problem formulation. Further, you want to not ship any product from source i to destination j. When modeling this situation you should:

a. Set all slacks to 0.  

b. Force the shipping cost, cij to zero.  

c. Set all constraints to ≤ type.  

d. Assign a large cost, cij = M, to the shipment quantity (Xij) between source i and destination j.

4. Consider a transportation problem, in which the total demand is greater than the total supply. To bring this problem to a standard form you should:

a. Do nothing. Just solve the problem.  

b. Add a dummy destination whose demand is equal to the difference between total demand and total supply.  

c. Delete one or more destinations so that the total available capacity is not exceeded.  

d. Add a dummy supply whose capacity is equal to the difference between total demand and total supply. See "dummy nodes and arcs" in chapter 5 for more information.