Let's see what the resulting initial basic feasible solution looks like in a transportation simplex tableau.
| Transportation Problem - Initial Solution | Previous | Next |
|
|
| Vogel's Approximation: | |
| With only one column remaining, every location in
this column is used to make the largest possible allocation (10 from Source
1 to Destination 2, 30 from Source 3 to Destination 2).
Let's see what the resulting initial basic feasible solution looks like in a transportation simplex tableau. |
|