Exam 6: Transportation, Assignment, and Transshipment Problems

In a transportation problem with 5 supply points, 3 demand points, and total supply equaling total demand, the number of decision variables will be

Carlos Ginsburg, a manger at Transship Inc., recently returned from a seminar on transshipment type problems. He wanted to cast his company's shipping plan into a transshipment problem. Formulate the problem and help Carlos get his promotion.

An assignment problem with 6 projects and 7 potential managers who can handle each of the projects, though with differing efficiency, can be solved by adding a dummy manager.

The total supply must be less than total demand in a transportation problem in order to solve it by the transportation algorithm.

In order to solve a transshipment problem, the number of intermediate points

Coast to Central Plains Inc. has warehouses in Piscataway, San Francisco, and Miami. It supplies the demand at four distribution centers in Austin, Lafayette, Toledo, and Knoxville from these warehouses. Data on cost, demand, and supply are given in the table below. Solve this using excel and report the optimal solution and the total cost corresponding to the optimal solution.

The transshipment problem formulation may be used in place of transportation formulation when there are two products that are being shipped, each having its own per unit cost of shipping.

The total supply must be greater than total demand in a transportation problem in order to solve it by the transportation algorithm.

The number of possible assignments in an assignment problem with 4 jobs and 4 workers to assign them to would be 16.

In a transportation problem, if supply point 2 cannot ship to demand point 3 , all other things remaining the same as a regular transportation problem, the problem

In a transportation problem with 5 supply points, 3 demand points, and total supply greater than total demand, the number of decision variables will be

In a transportation problem with total demand equal to 900 and total supply equal to 1200 , we should add a with a quantity equal to to convert it to a balanced problem.

The total supply must equal total demand in a transportation problem in order to solve it by the transportation algorithm.

In a linear programming formulation of the assignment problem, the RHS of all constraints is equal to 1.

In a transportation problem with total demand equal to 1200 and total supply equal to 900 , we should add a with a quantity equal to to convert it to a balanced problem.

The linear programming formulation of a transportation problem, in general, has demand constraints which are either $\geq$ or $=$ type.

The linear programming formulation of a transportation problem, in general, has supply constraints which are either $\geq$ or $=$ type.

Transportation and assignment problems can be solved by the simplex method, though special purpose algorithms offer an easier solution procedure.

If one formulates a transportation problem with 5 supply points, 3 demand points, and total supply greater than total demand, as a linear programming problem, the number of constraints will be

Data on cost, demand, and supply for a balanced (total supply equals total demand) transportation problem is given in the table below. In the linear programming formulation of this transportation problem with $\mathrm{X}_{i j}$ denoting the amount shipped from supply point $i$ (1 or 2 ) to demand point $j(1,2$ , or 3 ), the correct constraint to make sure that demand in demand point 1 is fully met is