# Question: The Versatech Corporation has decided to produce three new products

The Versatech Corporation has decided to produce three new products. Five branch plants now have excess product capacity. The unit manufacturing cost of the first product would be $31, $29, $32, $28, and $29 in Plants 1, 2, 3, 4, and 5, respectively. The unit manufacturing cost of the second product would be $45, $41, $46, $42, and $43 in Plants 1, 2, 3, 4, and 5, respectively. The unit manufacturing cost of the third product would be $38, $35, and $40 in Plants 1, 2, and 3, respectively, whereas Plants 4 and 5 do not have the capability for producing this product. Sales forecasts indicate that 600, 1,000, and 800 units of products 1, 2, and 3, respectively, should be produced per day. Plants 1, 2, 3, 4, and 5 have the capacity to produce 400, 600, 400, 600, and 1,000 units daily, respectively, regardless of the product or combination of products involved. Assume that any plant having the capability and capacity to produce them can produce any combination of the products in any quantity.

Management wishes to know how to allocate the new products to the plants to minimize total manufacturing cost.

(a) Formulate this problem as a transportation problem by constructing the appropriate parameter table.

Management wishes to know how to allocate the new products to the plants to minimize total manufacturing cost.

(a) Formulate this problem as a transportation problem by constructing the appropriate parameter table.

**View Solution:**## Answer to relevant Questions

Consider the assignment problem having the following cost table. Manually apply the Hungarian algorithm (perhaps using the corresponding interactive procedure in your IOR Tutorial) to solve the assignment problem having the following cost table: The Onenote Co. produces a single product at three plants for four customers. The three plants will produce 60, 80, and 40 units, respectively, during the next time period. The firm has made a commitment to sell 40 units to ...Formulate the maximum flow problem as a linear programming problem. Reconsider Prob. 10.3-3. Now formulate this problem as a minimum cost flow problem by showing the appropriate network representation.Post your question