Professional Documents
Culture Documents
Which of these is the most efficient method of finding an Initial Basic Feasible Solution in
transportation problem (a) North West Corner Method (b) Least Cost Method (c) Vogel’s
Approximation Method (VAM) (d) Stepping Stone c
2. Which is the best combination for solving a Transportation Problem (a) NWCM-Stepping
Stone (b) Least Cost Method- MODI (c) VAM-MODI (d) VAM-Stepping Stone c
4. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are
occupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a. Occupied path
b. Open path
c. Closed path
d. None of the above c
5. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
a. Simple problem
b. Balanced problem
c. Transportation problem
d. None of the above b
6. The solution to a transportation problem with m-rows (supplies) and n-columns (destinations)
is feasible if the number of positive allocations are (a) m +n (b) m X n (c) m + n – 1 (d) m
+ n +1 c
7. Which of the following methods is used to verify the optimality of the current solution of the
transportation problem, (a) Least Cost Method (b) Vogel’s Approximation Method (c) Modified
Distribution Method (MODI) (d) All of the above c
8. The smallest quantity is chosen at the corners of the closed path with negative sign to be
assigned at unused cell because:
10. Through this method, the feasible solution that would be obtained is either optimal or very
close to the optimal solution.
a. Hungarian Method
b. North-West Corner Rule Method
c. Vogel's Approximation Method
d. Stepping Stone Method c