The Gateway to Computer Science Excellence
+1 vote

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

Has a solution

  A B C
I 1    
II 3 0  
III   2 2

The above solution of a given transportation problem is

  1. Infeasible solution
  2. optimum solution
  3. non-optimum solution
  4. unbounded solution
in Others by Veteran (105k points)
recategorized by | 1.7k views

2 Answers

+2 votes
Best answer

Ans is B optimum solution

No automatic alt text available.

by Boss (49.3k points)
selected by
Hi sir,

your answer is correct but small correction for 1st row 2nd column dij=+25


yes it will be  25
The number of allocations are 4 only (0 allocation is by default for every cell), so shouldn't it be (A) Infeasible?
that is the condition for degeneracy and not of infeasibility
In your answer to UGCNET-Dec2014-III-68 you stated that occurrence of degeracy while solving transportation problem means the solution obtained is not feasible.
to resolve degeneracy allocation of 0 is done
Can you please clear how u1 = -195. Aren't we to suppose that u1 = 0 in the beginning?

Sanjay Sir's solution is not showing up.
0 votes
Answer should be (A) Infeasible.

The number of allocations are 4 only (0 allocation is by default for every cell) and as they're less than m+n-1 that is 3+3-1=5, the solution is Infeasible.
by (131 points)
yeah , But condition is that number of allocation should be less then m+n-1

Related questions

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
50,737 questions
57,281 answers
104,842 users