Register

UGC NET CSE | June 2013 | Part 3 | Question: 25

• edited by
4,797 views
1 votes
1 votes

The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is

$\begin{array}{|l|l|l|l|} \hline \text{} & \textbf{W1} & \textbf{W2} & \textbf{W3} & \textbf{W4} & \textbf{W5} & \textbf{Supply} \\\hline  \textbf{F1} & \text{4} & \text{2} & \text{3} & \text{2} & \text{6} & \text{8} \\\hline  \textbf{F2} & \text{5} & \text{4} & \text{5} & \text{2} & \text{1} & \text{12} \\\hline  \textbf{F3} & \text{6} & \text{5} & \text{4} & \text{7} & \text{3} & \text{14} \\\hline  \textbf{Demand} & \text{4} & \text{4} & \text{6} & \text{8} & \text{8} & \text{} \\\hline  \end{array}$

  1. $76$
  2. $80$
  3. $90$
  4. $96$
• edited by
User Avatar

1 Answer

0 votes
0 votes

Ans is B 80       W6 should be replaced by Supply column and since demand total =30 ans supply total =34 so a dummy column is introduced with cost 4 as below to balance the problem . then difference between two min values are calculated for every /row column and it is called penalty.

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 16, 2016
6,845 views
UGC NET CSE | June 2013 | Part 3 | Question: 24
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
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.degeneratenon...
User Avatar
3 votes
3 votes
1 answer
2
go_editor asked Jul 16, 2016
3,951 views
UGC NET CSE | June 2013 | Part 3 | Question: 23
At any iteration of simplex method if $\Delta j (Zj – Cj)$ corresponding to any non-basic variable $Xj$ is obtained as zero, the solution under the test is Degenerate solution Unbounded solution Alternative solution Optimal solution
At any iteration of simplex method if $\Delta j (Zj – Cj)$ corresponding to any non-basic variable $Xj$ is obtained as zero, the solution under the test isDegenerat...
User Avatar
1 votes
1 votes
1 answer
4
go_editor asked Jul 19, 2016
3,422 views
UGC NET CSE | June 2013 | Part 3 | Question: 75
Consider a single perception with weights as given in the following figure: and $f(t)$ is defined as $f(t) \bigg\{ 1, t>0 \: 0, t \leq 0$ The above perception can solve OR problem AND problem XOR problem All of the above
Consider a single perception with weights as given in the following figure:and $f(t)$ is defined as$f(t) \bigg\{ 1, t>0 \: 0, t \leq 0$The above perception can solveOR p...
User Avatar
Link Copied!