# Question

A company will be producing the same new product at two different factories, and then the product must be shipped to two warehouses. Factory 1 can send an unlimited amount by rail to warehouse 1 only, whereas factory 2 can send an unlimited amount by rail to warehouse 2 only. However, independent truckers can be used to ship up to 50 units from each factory to a distribution center, from which up to 50 units can be shipped to each warehouse.

The shipping cost per unit for each alternative is shown in the following table, along with the amounts to be produced at the factories and the amounts needed at the warehouses.

(a) Formulate the network representation of this problem as a minimum cost flow problem.

(b) Formulate the linear programming model for this problem.

The shipping cost per unit for each alternative is shown in the following table, along with the amounts to be produced at the factories and the amounts needed at the warehouses.

(a) Formulate the network representation of this problem as a minimum cost flow problem.

(b) Formulate the linear programming model for this problem.

## Answer to relevant Questions

Reconsider Prob. 10.3-3. Now formulate this problem as a minimum cost flow problem by showing the appropriate network representation. Reconsider the minimum cost flow problem formulated in Prob. 10.6-3. Reconsider the Tinker Construction Co. problem presented in Prob. 10.8-1. While in college, Sean Murphy took an OR course that devoted a month to linear programming, so Sean has decided to use linear programming to analyze ...Formulate the shortest-path problem as a linear programming problem. Consider the following nonlinear programming problem. Maximize Z = 2x21 + 2x2 + 4x3 – x23 Subject to 2x1 + x2 + x3 ≤ 4 and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Use dynamic programming to solve this problem.Post your question

0