The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged transportationproblem
+2
votes
1
answer
1
UGCNETAUG2016III63
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)
asked
Oct 4, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.8k
points)

429
views
ugcnetaug2016iii
linearprogramming
transportationproblem
+1
vote
2
answers
2
UGCNETJune2016III63
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 Infeasible solution optimum solution nonoptimum solution unbounded solution
asked
Aug 21, 2016
in
Others
by
jothee
Veteran
(
103k
points)

1.6k
views
ugcnetjune2016iii
operationresearch
transportationproblem
+2
votes
1
answer
3
UGCNETDec2015III54
Consider the following transportation problem: The transportation cost in the inital basic feasible solution of the above transportation problem using Vogel's Approximation method is 1450 1465 1480 1520
asked
Aug 11, 2016
in
Others
by
jothee
Veteran
(
103k
points)

2.4k
views
ugcnetdec2015iii
operationresearch
transportationproblem
+2
votes
1
answer
4
UGCNETDec2015III53
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+n1, where m is the number of rows and n is the number of columns All the positive ... be nondegenerate basic feasible 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
Others
by
jothee
Veteran
(
103k
points)

715
views
ugcnetdec2015iii
operationresearch
transportationproblem
+4
votes
1
answer
5
UGCNETDec2014III68
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
asked
Aug 2, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.8k
points)

745
views
ugcnetdec2014iii
operationalresearch
transportationproblem
+3
votes
3
answers
6
UGCNETJune2015III68
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
Others
by
jothee
Veteran
(
103k
points)

1.6k
views
ugcnetjune2015iii
transportationproblem
operationresearch
+1
vote
1
answer
7
UGCNETJune2013III25
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 76 80 90 96
asked
Jul 16, 2016
in
Others
by
jothee
Veteran
(
103k
points)

1.7k
views
ugcnetjune2013iii
linearprogramming
transportationproblem
+2
votes
1
answer
8
UGCNETJune2013III24
A basic feasible solution to a morigin, ndestination transportation problem is said to be ______ if the number of positive allocations are less than m+n1. degenerate non degenerate unbounded unbalanced
asked
Jul 16, 2016
in
Others
by
jothee
Veteran
(
103k
points)

458
views
ugcnetjune2013iii
linearprogramming
transportationproblem
+1
vote
2
answers
9
UGCNETDec2012III28
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$ ... = 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
asked
Jul 12, 2016
in
Others
by
jothee
Veteran
(
103k
points)

1.7k
views
ugcnetdec2012iii
operationresearch
transportationproblem
+1
vote
1
answer
10
UGCNETJune2014III60
The initial basic feasible solution of the following transportion problem: is given as 5 8 7 2 2 10 then the minimum cost is 76 78 80 82
asked
Jul 11, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.8k
points)

1.2k
views
ugcnetjune2014iii
operationresearch
transportationproblem
To see more, click for the
full list of questions
or
popular tags
.
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
Recent Posts
Standard Book Exercise Questions for Computer Science
Resource to Learn Graph Theory Interactively
Recruitment to the post of Scientist/Engineer 'SC' (Electronics, Mechanical and Computer Science)
Standard Videos for Calculus
Standard Videos for Linear Algebra
Follow @csegate
Recent questions tagged transportationproblem
Recent Blog Comments
Are the answers also present ?
@Arjun sir , Is there any page or something where...
@arjun sir but u called about providing the pdfs...
But anyhow I appreciate this. The questions of...
All these PYQ blogs and standard videos blogs...
50,376
questions
55,836
answers
192,558
comments
91,335
users