Assertion (a): Transportation problem can be solved by VAM heuristic much faster as compared to the solution through liner programming method
Reason(R): VAM heuristic gives an approximate solution. It is checked for optimality test. If it is optimal the algorithm stops there. If it is not an optimal solution then improved solutions are found out through very few iterations till optimality is reached