Question: The following linear programming formulation is for a transshipment problem. Min 11 x 13 + 12 x 14 + 10 x 21 + 8 x
The following linear programming formulation is for a transshipment problem.
| Min | 11x13 | + | 12x14 | + | 10x21 | + | 8x34 | + | 10x35 | + | 11x42 | + | 9x45 | + | 12x52 | ||
| s.t. | |||||||||||||||||
| x13 | + | x14 | x21 | 5 | |||||||||||||
| x21 | x42 | x52 | 3 | ||||||||||||||
| x13 | x34 | x35 | 6 | ||||||||||||||
| x14 | x34 | + | x42 | + | x45 | 2 | |||||||||||
| x35 | + | x45 | x52 | 4 |
xij for all i, j.
Show the network representation of this problem.
Please don't copy some other problem that is already here if it's not this exact problem which defeats the purpose of me paying for this service.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
