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

Which step involves eliminating fully allocated rows or columns in the least cost method (LCM)?

• A) Step 3
• B) Step 2
• C) Step 1
• D) Step 4

The transportation problem can be represented mathematically as a linear programming model with the objective function of __________.

• A) Maximizing the total transportation cost
• B) Maximizing the total production cost
• C) Minimizing the total transportation cost
• D) Minimizing the total profit

In a Transportation Problem, the objective function ’Z’ gives ----------.

• A) Total inventory be supplied in transportation
• B) Total Cost of transportation
• C) Total Profit of transportation
• D) Total Time of transportation

You realize that a row's total supply cannot fully satisfy the demand in any column. This means that_________.

• A) You can ignore this row and continue.
• B) The original transportation problem has no feasible solution.
• C) You must add transportation costs to increase supply.
• D) You have made an error in earlier allocations.

The North – West Corner Rule

• A) Is based on the concept of minimizing opportunity cost.
• B) Is used to find an initial feasible solution
• C) None of above
• D) Is used to find optimal solution

What does the difference between the smallest and next to the smallest element in a row or column represent in VAM?

• A) Unit cost of transportation
• B) Penalty for wrong allocation
• C) Maximum feasible amount
• D) Total cost of transportation

For North West Corner method, in the first row and first column, each resource and sink contain ‘5’ units; then after allocating the appropriate amount ‘x11’ in the cell (1,1), in which of the following cell the next allocation will be zero?

• A) In cell (2,1) only
• B) In cell (1,2) only
• C) Neither in (1,2) nor in (2,1) but in along the diagonal in (2,2)
• D) Arbitrarily chosen either in (1,2) or in (2,1)

How is the maximum feasible quantity determined in the LCM?

• A) By calculating the transportation cost
• B) By selecting the next least cost
• C) By identifying the minimum value
• D) By multiplying the demand and supply

The solution of a transportation problem with m rows (supplies) and n (destinations) is feasible if numbers of positive allocations are

• A) m+n
• B) m-n+1
• C) m+n+1
• D) m+n-1

Which values of “$a_{ij}$'s” in the standard form of a linear programming problem will transform it in standard Transportation problem?

• A) $a_{ij} = 1$ for all $i =1,2,\cdots,m; j = 1,2,\cdots,n$
• B) $a_{ij} = 0$ and 1 for all $i =1,2,\cdots,m; j = 1,2,\cdots,n$
• C) $a_{ij} = 0$ for all $i =1,2,\cdots,m; j = 1,2,\cdots,n$
• D) $a_{ij} = 0$ or 1 for all $i =1,2,\cdots,m; j = 1,2,\cdots,n$

Under which of the following condition in the Least Cost Method, after first allocation in cell (1,1), next allocation along the diagonal in cell (2,2) can be made?

• A) If after crossed out 1st row or 1st column, cell (2,2) is of minimum cost
• B) Total Supply = Total Demand
• C) If in the second row and second column, each resource and sink contain equal units
• D) If Total Supply is not equal to Total Demand

The amount of the inventory will always taken to be -----------

• A) Negative
• B) Positive
• C)
• D)