Transportation Problem - Initial Solution | Previous | Next |
![]() |
![]() |
Vogel's Approximation: | |
Row 1 has the largest difference (2) of any row or column, so use the location of its smallest cost (2) to make the largest possible allocation (10 from Source 1 to Destination 1). This uses up the demand at Destination 1, so eliminate this column from consideration. Subtract 10 from the supply for Source 1. |