Initial basic feasible solution by VAM (Vogel's Approximation Method) of Transportation Problem

VAM The Vogel’s Approximation Method in transportation problem of operations research takes into account not only the least cost cij but also the cost that just exceeds cij. The IBFS obtained by Vogel’s method is either optimal or very close to the optimal solutions. The steps of the method are given below 1. Compute difference between the smallest and second smallest costs in each row and column. These differences are called penalties or opportunity cost. 2. Identify the row or column with the largest difference among all the rows and columns. 3. Check the row or column with the largest difference and select minimum cost cell and allocate as much as possible to these cell. Adjust the supply and demand constraints. 4. Again compute difference between the smallest and second smallest costs in each row and column of reduced transportation table and do the same as above until all the supply and demand constraints are satisfied. Note :- If there is a tie among maximum difference then select row or column for allocation in which total cost is minimum. And if there is tie among minimum total cost then select any row or column arbitrary. thanks and regards team beinggourav.com #VAM #IBFS #OPERATIONSRESEARCH -~-~~-~~~-~~-~- Please watch: "UNBALANCED ASSIGNMENT PROBLEM IN OPERATION RESEARCH | USING HUNGARIAN METHOD | Lecture 03" https://www.youtube.com/watch?v=49R8QHUFSAg -~-~~-~~~-~~-~-