Why do we use specialized algorithms for transportation problems instead of the simplex method?

• A) Transportation models are too complex.
• B) Specialized algorithms are more efficient.
• C) The simplex method cannot handle equality constraints.
• D) The simplex method is used for maximization only.

In the Least Cost Method, for any cell both demand and supply are satisfied then which of the following will be crossed out?

• A) Either of row or column
• B) Only column
• C) Both row and column
• D) Only row

Which of the following method to find the solution of a Transportation Problem can be observed as improved version of Least Cost Method?

• A) North West Corner Method
• B) Vogal’s approximation Method
• C)
• D)

If Primal Problem is a maximization problem, then the dual will be -------

• A) mixed Problem
• B) none of the above
• C) minimization Problem
• D) maximization Problem

If the primal has an unbounded solution, then the dual has------

• A) infeasible solution
• B) bounded solution
• C) optimal solution
• D) no solution

For a Transportation problem, after finding the initial basic feasible solution, which of the following method is used to find the optimum solution?

• A) None of these
• B) Least Cost Method
• C) North West Corner Method
• D) Vogel’s approximation Method

If the total demand is equal to total supply as per requirement of a balanced transportation problem i-e “$a_1+a_2+ \cdots +a_n = b_1+b_2+\cdots+b_n$” then which of the following is true?

• A) “$a_1=b_1, a_2=b_2,\cdots, a_n=b_n$” is necessarily implied
• B) “$a_1=b_1, a_2 =b_2,\cdots, a_n=b_n$” is NOT necessarily implied
• C)
• D)

In the Least Cost Method, allocations are made in a cell by assigning -----------to cell with smallest unit cost.

• A) minimum
• B) maximum
• C) any arbitrary amount
• D) average of maximum and minimum

Dual of a Dual is ------

• A) Primal
• B) (Dual)^2
• C) Dual
• D) Primal-dual

Which of the following method is used to find the initial basic feasible solution of a transportation problem?

• A) Least Cost’s Method
• B) North West Corner Method
• C) Vogel’s approximation Method
• D) All above methods are applicable

Which of the following reason to prefer Vogel’s approximation method over other two methods?

• A) Vogel’s method gives the feasible solution near to the optimal
• B) Vogel’s method gives optimal time plan of transportation
• C) Vogel’s method gives the shortest transportation rout
• D) Vogel’s method allocate minimum amount to the variable with least unit cost

How is the least cost method (LCM) different from the Northwest Corner rule (NWC)?

• A) LCM starts from the bottom right corner
• B) LCM allocates the maximum feasible amount
• C) LCM follows a random allocation strategy
• D) LCM considers unit costs of transportation

How is Vogel's Approximation Method (VAM) different from the least cost method (LCM)?

• A) VAM considers penalties for wrong allocations
• B) VAM starts from the bottom right corner
• C) VAM does not consider penalties
• D) VAM does not consider unit costs

What is the penalty in Vogel's Approximation Method (VAM)?

• A) The number of iterations required to find the optimal solution
• B) The difference between the smallest and next to the smallest element in a row or column
• C) The total transportation cost
• D) The amount allocated to each cell in the transportation table

For a Transportation Problem, if it’s initial feasible solution is evaluated by Least Cost Method, then quality of this initial solution is better than ----------.

• A) North West Corner Method
• B) Vogal’s approximation Method
• C)
• D)

After identifying the row with the least cost, what action is taken in the LCM?

• A) Determine the next least cost
• B) Allocate the maximum feasible quantity
• C) Eliminate the row
• D) Repeat the process for all columns

What action is taken if a row or column is empty in the LCM?

• A) Allocate the remaining quantities
• B) Increase the transportation cost
• C) Repeat the allocation process
• D) Eliminate the row or column

In North West Corner Rule, we start initially from which of the following cell in the standard transportation table?

• A) Upper middle
• B) Upper right
• C) Upper left
• D) From any arbitrary cell in first row

If Dual has a finite optimal solution, then the primal will------.

• A) none of the above
• B) have only basic feasible solution
• C) have also finite optimal solution
• D) not have a solution

Which of the following can be said the main objective of the Least Cost Method to solve a transportation problem?

• A) Concentrating on the routes with maximum available transportation time
• B) Concentrating on the routes with cheapest cost of transportation
• C) Concentrating on the routes with least transportation time
• D) Concentrating on the routes with expensive cost of transportation