search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
1 vote
2.2k views

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{$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}=10, 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
in Optimization
edited by
2.2k views

2 Answers

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
sir, x23  should be 30. isn't it?
0
no , before x23 , x13 will be satisfied due to its lesser cost
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

0
VAM is needed only to find correct soln , here question can be answered  from  options itself
Answer:

Related questions

1 vote
1 answer
1
2.5k views
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are 6 8 10 12
asked Jul 12, 2016 in Optimization jothee 2.5k views
3 votes
1 answer
2
3k views
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$
asked Aug 11, 2016 in Optimization jothee 3k views
2 votes
1 answer
3
985 views
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$
asked Aug 11, 2016 in Optimization jothee 985 views
3 votes
3 answers
4
2.2k views
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
asked Aug 2, 2016 in Optimization jothee 2.2k views
...