Question: 14 Consider the transportation data set for a distribution problem below. From to Dest 1 Dest 2 Dest 3 Dest 4 Total Supply Plant
14
Consider the transportation data set for a distribution problem below.
| From \ to | Dest 1 | Dest 2 | Dest 3 | Dest 4 | Total Supply |
| Plant 1 | $14 | $15 | $12 | $11 | 130 |
| Plant 2 | $10 | $16 | $7 | $23 | 80 |
| Plant 3 | $19 | $8 | $12 | $24 | 105 |
| Total Demand | 80 | 75 | 90 | 65 |
|
In this linear programming model, the objective function should be written as . . .
| Maximize 14x11 + 15x12 +12x13 + 11x14 + 10x21 + 16x22 + 7x23 + 23x24 + 19x31 + 8x32 + 12x33 + 24x34 | ||
| Minimize 14x11 + 15x12 +12x13 + 11x14 + 10x21 + 16x22 + 7x23 + 23x24 + 19x31 + 8x32 + 12x33 + 24x34 | ||
| Maximize x11 + x12 + x13 + x14 + x21 + x22 + x23 + x24 + x31 + x32 + x33 + x34 | ||
| Minimize x11 + x12 + x13 + x14 + x21 + x22 + x23 + x24 + x31 + x32 + x33 + x34 |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
