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