Question: Draw the network for this transportation problem. (Let x ij represent the flow from node i to node j .) Min 2 x 13 +
Draw the network for this transportation problem. (Let xij represent the flow from node i to node j.)
Min 2x13 + 4x14 + 4x15 + 8x23 + 11x24 + 11x25
| s.t. | |||||
| x13 + x14 + x15 | 500 | ||||
| x23 + x24 + x25 | 400 | ||||
| x13 + x23 | = | 300 | |||
| x14 + x24 | = | 300 | |||
| x15 + x25 | = | 300 | |||
| xij 0 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
