VAM Step 3: Assign as many units as possible to the lowest cost square in the row or column selected. Step 3 has been done in Table T4.6. Under Column A, the lowest-cost route is D–A (with a cost of $5), and 100 units have been assigned to that square. No more were placed in the square because doing so would exceed D’s availability.
VAM Step 4: Eliminate any row or column that has just been completely satisfied by the assignment just made. This can be done by placing Xs in each appropriate square. Step 4 has been done in Table T4.6 D row. No future assignments will be made to the D–B or D–C routes.
VAM Step 5: Recompute the cost differences for the transportation table, omitting rows or columns crossed out in the preceding step. This is also shown in Table T4.6. A’s, B’s, and C’s differences each change. D’s row is eliminated, and E’s and F’s differences remain the same as in Table T4.5.
VAM Step 6: Return to step 2 and repeat the steps until an initial feasible solution has been obtained.
VAM Step 3: Assign as many units as possible to the lowest cost square in the row or column selected. Step 3 has been done in Table T4.6. Under Column A, the lowest-cost route is D–A (with a cost of $5), and 100 units have been assigned to that square. No more were placed in the square because doing so would exceed D’s availability.VAM Step 4: Eliminate any row or column that has just been completely satisfied by the assignment just made. This can be done by placing Xs in each appropriate square. Step 4 has been done in Table T4.6 D row. No future assignments will be made to the D–B or D–C routes.VAM Step 5: Recompute the cost differences for the transportation table, omitting rows or columns crossed out in the preceding step. This is also shown in Table T4.6. A’s, B’s, and C’s differences each change. D’s row is eliminated, and E’s and F’s differences remain the same as in Table T4.5.VAM Step 6: Return to step 2 and repeat the steps until an initial feasible solution has been obtained.
การแปล กรุณารอสักครู่..