edited by
4,692 views
1 votes
1 votes

The initial basic feasible solution to the following transportation problem using Vogel’s approximation method is

$\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{$D_1$} & \textbf{$D_2$} & \text{$D_3$} & \text{$D_4$} & \textbf{Supply} \\\hline \textbf{$S_1$} & \text{1} & \text{2} & \text{1} & \text{4} & \text{30} \\\hline \textbf{$S_2$} & \text{3} & \text{3} & \text{2} & \text{1} & \text{50} \\\hline \textbf{$S_3$} & \text{4} & \text{2} & \text{5} & \text{9} & \text{20} \\\hline \textbf{Demand} & \text{20} & \text{40} & \text{30} & \text{10} \\\hline \end{array}$

  1. $x_{11}=20, x_{13}=10, x_{21}=20, x_{23}=20, x_{24}=10, x_{32}=10$, Total cost $= 180$
  2. $x_{11}=20, x_{12}=20, x_{13}=10, x_{22}=20, x_{23}=20, x_{24}=10$, Total cost $= 180$
  3. $x_{11}=20, x_{13}=10, x_{22}=20, x_{23}=20, x_{24}=10, x_{32}=10$, Total cost $= 180$
  4. None of the above
edited by

2 Answers

0 votes
0 votes

Ans should be D)none of these as Choice A , B,C  are giving only 90 demand and  supply  allocations whereas given demand and supply are 100. 

Method is as per vogel algo summary  

1)first calculate penalty(difference between two min values ) for each row and column 2)

now select the column with max penalty and search the least cost in that col/row

4)assign the max allocations and update the row/column demand supply

5)cross out the exhausted row/colum

Repeat the above procedure

Correct ans should be X11=20 , X13=10,    X22=20    ,    X23=20   , X24=10, X32=20, Total cost = 180    

0 votes
0 votes

Instead if applying entire VAM we cant do a shortcut here. put the option a b and c and check if they are correct or not.

Therefore option D

Answer:

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Aug 11, 2016
5,483 views
Consider the following transportation problem:The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximati...
1 votes
1 votes
1 answer
3
go_editor asked Jul 12, 2016
13,532 views
If dual has an unbounded solution, then its corresponding primal hasno feasible solutionunbounded solutionfeasible solutionnone of these
1 votes
1 votes
1 answer
4
go_editor asked Jul 12, 2016
4,230 views
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are681012