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
Recent questions tagged operationresearch
+1
vote
2
answers
1
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
(
104k
points)

1.6k
views
ugcnetjune2016iii
operationresearch
transportationproblem
+1
vote
1
answer
2
UGCNETJune2016III62
Consider the following statements: Revised simplex method requires lesser computations than the simplex methods Revised simplex method automatically generates the inverse of the current basis matrix Less number of entries are needed in each table of the revised simplex method than usual simplex ... these statements is true? a and b only a and c only b and c only a, b, and c
asked
Aug 21, 2016
in
Others
by
jothee
Veteran
(
104k
points)

656
views
ugcnetjune2016iii
operationresearch
simplexmethod
+3
votes
1
answer
3
UGCNETJune2016III61
The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem exists concavity convexity quadratic polyhedron
asked
Aug 21, 2016
in
Others
by
jothee
Veteran
(
104k
points)

892
views
ugcnetjune2016iii
operationresearch
linearprogramming
+2
votes
1
answer
4
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
(
104k
points)

2.5k
views
ugcnetdec2015iii
operationresearch
transportationproblem
+2
votes
1
answer
5
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
(
104k
points)

727
views
ugcnetdec2015iii
operationresearch
transportationproblem
+1
vote
1
answer
6
UGCNETDec2015III52
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zero generate degenerate infeasible unbounded
asked
Aug 11, 2016
in
Others
by
jothee
Veteran
(
104k
points)

1k
views
ugcnetdec2015iii
operationresearch
linearprogramming
+3
votes
2
answers
7
UGCNETDec2015III47
In constraint satisfaction problem, constraints can be stated as Arithmetic equations and inequalities that bind the values of variables Arithmetic equations and inequalities that does not bind any restriction over variables Arithmetic equations that impose restrictions over variables Arithmetic equations that discard constraints over the given variables
asked
Aug 11, 2016
in
Others
by
jothee
Veteran
(
104k
points)

611
views
ugcnetdec2015iii
operationresearch
+2
votes
1
answer
8
UGCNETJune2015III69
Given the following statements with respect to linear programming problem: S1: The dual of the dual linear programming problem is again the primal problem S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible ... problems are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
asked
Aug 2, 2016
in
Others
by
jothee
Veteran
(
104k
points)

856
views
ugcnetjune2015iii
operationresearch
linearprogramming
+3
votes
3
answers
9
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
(
104k
points)

1.6k
views
ugcnetjune2015iii
transportationproblem
operationresearch
+3
votes
1
answer
10
UGCNETJune2015III67
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of rows or columns rows + columns rows + columns 1 rows + columns +1
asked
Aug 2, 2016
in
Others
by
jothee
Veteran
(
104k
points)

783
views
ugcnetjune2015iii
assignmentproblem
operationresearch
+2
votes
1
answer
11
UGCNETDec2013III3
The following Linear Programming problem has: $\text{Max} \quad Z=x_1+x_2$ Subject to $\quad x_1x_2 \geq 0$ $\quad \quad \quad 3x_1  x_2 \leq 3$ $\text{and} \quad x_1 , x_2 \geq 0 $ Feasible solution No feasible solution Unbounded solution Single point as solution
asked
Jul 27, 2016
in
Others
by
jothee
Veteran
(
104k
points)

930
views
ugcnetdec2013iii
operationresearch
linearprogramming
+2
votes
1
answer
12
UGCNETDec2013III2
Given the problem to maximize $f(x), X=(x_1, x_2, \dots , x_n)$ subject to m number of in equality constraints. $g_i(x) \leq b_i$, i=1, 2, .... m including the nonnegativity constrains $x \geq 0$. Which of the following conditions is a KuhnTucker necessary condition for a local ... $g_i (\bar{X}) \leq b_i, i=1,2 \dots m$ All of these
asked
Jul 27, 2016
in
Others
by
jothee
Veteran
(
104k
points)

382
views
ugcnetdec2013iii
operationresearch
linearprogramming
+2
votes
1
answer
13
UGCNETDec2013III1
If the primal Linear Programming problem has unbounded solution, then it's dual problem will have feasible solution alternative solution no feasible solution at all no alternative solution at all
asked
Jul 27, 2016
in
Others
by
jothee
Veteran
(
104k
points)

685
views
ugcnetdec2013iii
operationresearch
linearprogrammingproblem
0
votes
1
answer
14
UGCNETDec2014II49
________ model is designed to bring prices down by increasing the number of customers who buy a particular product at once. Economic Order Quantity Inventory Data Mining DemandSensitive Pricing
asked
Jul 23, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.9k
points)

466
views
ugcnetdec2014ii
operationresearch
inventory
+1
vote
2
answers
15
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
(
104k
points)

1.8k
views
ugcnetdec2012iii
operationresearch
transportationproblem
+1
vote
1
answer
16
UGCNETDec2012III24
If dual has an unbounded solution, then its corresponding primal has no feasible solution unbounded solution feasible solution none of these
asked
Jul 12, 2016
in
IS&Software Engineering
by
jothee
Veteran
(
104k
points)

2.1k
views
ugcnetdec2012iii
operationresearch
duallinearprogramming
+1
vote
1
answer
17
UGCNETDec2012III18
In a Linear Programming Problem, suppose there are three basic variables and 2 nonbasic variables, then the possible number of basic solutions are 6 8 10 12
asked
Jul 12, 2016
in
Others
by
jothee
Veteran
(
104k
points)

2.1k
views
ugcnetdec2012iii
operationresearch
linearprogramming
+1
vote
1
answer
18
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.9k
points)

1.2k
views
ugcnetjune2014iii
operationresearch
transportationproblem
0
votes
1
answer
19
UGCNETJune2014III59
The given maximization assignment problem can be converted into a minimization problem by Subtracting each entry in a column from the maximum value in that column. Subtracting each entry in the table from the maximum value in that table. Adding each entry in a column from the maximum value in that column. Adding maximum value of the table to each entry in the table.
asked
Jul 11, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.9k
points)

754
views
ugcnetjune2014iii
operationresearch
assignmentproblem
+1
vote
1
answer
20
UGCNETJune2014III58
Which of the following special cases does not require reformulation of the problem in order to obtain a solution ? Alternate optimality Infeasibility Unboundedness All of the above
asked
Jul 11, 2016
in
Others
by
makhdoom ghaya
Boss
(
29.9k
points)

848
views
ugcnetjune2014iii
operationresearch
+2
votes
3
answers
21
UGCNETJune2012III62
The optimal solution of the following assignment problem using Hungarian method is I II III IV A 8 26 17 11 B 13 28 4 26 C 38 19 18 15 D 19 26 24 10 A B C D A I II III IV B I III II IV C I III IV II D I IV II III
asked
Jul 7, 2016
in
IS&Software Engineering
by
jothee
Veteran
(
104k
points)

1.4k
views
ugcnetjune2012iii
operationresearch
assignmentproblem
+3
votes
1
answer
22
UGCNETJune2012III49
In any simplex table, if corresponding to any negative $\Delta$ j, all elements of the column are negative or zero, the solution under the test is degenerate solution unbounded solution alternative solution nonexisting solution
asked
Jul 7, 2016
in
IS&Software Engineering
by
jothee
Veteran
(
104k
points)

820
views
ugcnetjune2012iii
operationresearch
linearprogramming
+2
votes
1
answer
23
UGCNETJune2012III46
The feasible region represented by the constraints $x_1  x_2 \leq 1, x_1 + x_2 \geq 3, x_1 \geq 0, x_2 \geq 0$ of the objective function Max $Z=3x_1 + 2x_2$ is A polygon Unbounded feasible region A point None of these
asked
Jul 7, 2016
in
Others
by
jothee
Veteran
(
104k
points)

932
views
ugcnetjune2012iii
operationresearch
linearprogramming
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
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Minimal Deterministic Finite Automata
To be aware of fake GATE test series
Standard Book Exercise Questions for Computer Science
Follow @csegate
Recent questions tagged operationresearch
Recent Blog Comments
Favorite is not working for blogs.. In favorites...
Favourite option does work. But list options...
Blog favorite button doesnt work?
@Arjun Sir can we have an option to save such...
Thanks Sir
50,666
questions
56,163
answers
193,778
comments
93,852
users