# Recent questions tagged transportation-problem

1
Consider the following statements : (a) Assignment problem can be used to minimize the cost. (b) Assignment problem is a special case of transportation problem. (c) Assignment problem requires that only one activity be assigned to each resource. Which of the following options is correct ? (a) and (b) only (a) and (c) only (b) and (c) only (a), (b) and (c)
1 vote
2
The following transportation problem A B C Supply I 50 30 220 1 II 90 45 170 3 III 250 200 50 4 Demand 4 2 2 0 ... The above solution of a given transportation problem is Infeasible solution optimum solution non-optimum solution unbounded solution
3
Consider the following transportation problem: The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximation method is $1450$ $1465$ $1480$ $1520$
4
Consider the following conditions: The solution must be feasible, i.e. it must satisfy all the supply and demand constraints The number of positive allocations must be equal to $m+n-1$, where $m$ is the number of rows and $n$ is the number of columns All the positive allocations must be in independent ... solution if it satisfies: $a$ and $b$ only $a$ and $c$ only $b$ and $c$ only $a$, $b$ and $c$
5
The occurrence of degeneracy while solving a transportation problem means that Total supply equals total demand Total supply does not equal total demand The solution so obtained is not feasible ​None of these
6
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
1 vote
7
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel's Approximation method is W1 W2 W3 W4 W5 W6 F1 4 2 3 2 6 8 F2 5 4 5 2 1 12 F3 6 5 4 7 3 14 Demand 4 4 6 8 8 $\begin{array}{|l|l|l|l|} \hline \text{} & \text{$ ... 76 80 90 96
8
A basic feasible solution to a m-origin, n-destination transportation problem is said to be ______ if the number of positive allocations are less than m+n-1. degenerate non- degenerate unbounded unbalanced
1 vote
9
The initial basic feasible solution to the following transportation problem using Vogel's approximation method is $D_1$ $D_2$ $D_3$ $D_4$ Supply $S_1$ 1 2 1 4 30 $S_2$ 3 3 2 1 50 $S_3$ 4 2 5 9 20 Demand 20 40 30 10 $\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{$ ... cost = 180 $x_{11}=20, x_{13}=10, x_{22}=20, x_{23}=20, x_{24}=10, x_{32}=10$, Total cost = 180 None of the above
1 vote