Question: Linear Programming Method (3 pts) Destination Supply Mill A (Chicago) Mill B (St. Luis) Mill C (Cincinnati) Source (Grain elevator) Source I (Kansas City) 5
Linear Programming Method (3 pts)
|
| Destination | Supply | |||||
| Mill A (Chicago) | Mill B (St. Luis) | Mill C (Cincinnati) |
|
| |||
| Source (Grain elevator) | Source I (Kansas City) | 5 | 7 | 8 | 350 |
| |
| Source II (Lincoln) | 6 | 9 | 9 | 450 |
| ||
| Source III (Iowa City) | 4 | 5 | 10 | 600 |
| ||
| Demand |
| 300 | 550 | 550 | 1400 |
| |
Note: Balanced problem since supply matches the demand
Find the Transportation Cost (Linear Programming Method) =
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
