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 linearprogramming
0
votes
2
answers
1
UGCNETJuly2018II83
The following LLP $\text{Maximize } z=100x_1 +2x_2+5x_3$ Subject to $14x_1+x_26x_33+3x_4=7$ $32x_1+x_212x_3 \leq 10$ $3x_1x_2x_3 \leq 0$ $x_1, x_2, x_3, x_4 \geq 0$ has Solution : $x_1=100, \: x_2=0, \: x_3=0$ Unbounded solution No solution Solution : $x_1=50, \: x_2=70, \: x_3=60$
asked
Jul 13, 2018
in
Others
by
Pooja Khatri
Boss
(
10.9k
points)

544
views
ugcnetjuly2018ii
llp
linearprogramming
0
votes
0
answers
2
GATE198817iiiiii
The following table gives the cost of transporting one tonne of goods from the origins A, B, C to the destinations F, G, H. Also shown are the availabilities of the goods at the origins and the requirements at the destinations. The transportation problem ... i). For the solution of (ii) above, calculate the values of the duals and determine whether this is an optimal solution.
asked
Dec 20, 2016
in
Others
by
jothee
Veteran
(
105k
points)

142
views
gate1988
nongate
descriptive
linearprogramming
+1
vote
0
answers
3
GATE19882i
If the transportation problem is solved using some version of the simplex algorithm, under what condition will the solution always have integer values?
asked
Dec 11, 2016
in
Others
by
jothee
Veteran
(
105k
points)

103
views
gate1988
linearprogramming
descriptive
outofsyllabusnow
+1
vote
0
answers
4
GATE19901ix
Fill in the blanks: The solution to the following linear program $\max$ $X_{1}$ such that $X_{1}+2X_{2} \leq 10$ $X_{1} \leq 8$ $X_{1} \leq 1$ is ____________.
asked
Nov 19, 2016
in
Others
by
makhdoom ghaya
Boss
(
30.7k
points)

121
views
gate1990
descriptive
linearprogramming
nongate
+2
votes
1
answer
5
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
(
30.7k
points)

449
views
ugcnetaug2016iii
linearprogramming
transportationproblem
+1
vote
1
answer
6
UGCNETAUG2016III62
Consider the following statements : (a) If primal (dual) problem has a finite optimal solution, then its dual (primal) problem has a finite optimal solution. (b) If primal (dual) problem has an unbounded optimum solution, then its dual (primal) has no feasible solution at all. (c) Both primal ... 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
(
30.7k
points)

274
views
ugcnetaug2016iii
linearprogramming
duality
+2
votes
1
answer
7
UGCNETAUG2016III61
Consider the following linear programming problem : $\max. z = 0.50 x_{2} – 0.10x_{1}$ Subject to the constraints $2x_{1} + 5x_{2} \leq 80$ $x_{1} + x_{2} \leq 20$ and $x_{1}, x_{2} \geq 0$ The total maximum profit $(z)$ for the above problem is : $6$ $8$ $10$ $12$
asked
Oct 4, 2016
in
Others
by
makhdoom ghaya
Boss
(
30.7k
points)

614
views
ugcnetaug2016iii
linearprogramming
+3
votes
1
answer
8
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
(
105k
points)

913
views
ugcnetjune2016iii
operationresearch
linearprogramming
+1
vote
1
answer
9
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
(
105k
points)

1.1k
views
ugcnetdec2015iii
operationresearch
linearprogramming
+1
vote
1
answer
10
UGCNETDec2014III67
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is Optimum Infeasible Unbounded Degenerate
asked
Aug 2, 2016
in
Others
by
makhdoom ghaya
Boss
(
30.7k
points)

1.1k
views
ugcnetdec2014iii
linearprogramming
simplexmethod
+2
votes
1
answer
11
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
(
105k
points)

876
views
ugcnetjune2015iii
operationresearch
linearprogramming
+2
votes
1
answer
12
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
(
105k
points)

963
views
ugcnetdec2013iii
operationresearch
linearprogramming
+2
votes
1
answer
13
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
(
105k
points)

394
views
ugcnetdec2013iii
operationresearch
linearprogramming
+1
vote
1
answer
14
UGCNETSep2013III13
If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is Alternative solution Infeasible solution Unbounded solution Degenerate solution
asked
Jul 22, 2016
in
Others
by
jothee
Veteran
(
105k
points)

382
views
ugcnetsep2013iii
artificialintelligence
linearprogramming
+1
vote
1
answer
15
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
(
105k
points)

1.7k
views
ugcnetjune2013iii
linearprogramming
transportationproblem
+2
votes
1
answer
16
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
(
105k
points)

486
views
ugcnetjune2013iii
linearprogramming
transportationproblem
+2
votes
1
answer
17
UGCNETJune2013III23
At any iteration of simplex method if $\Delta j (Zj – Cj)$ corresponding to any nonbasic variable $Xj$ is obtained as zero, the solution under the test is Degenerate solution Unbounded solution Alternative solution Optimal solution
asked
Jul 16, 2016
in
Others
by
jothee
Veteran
(
105k
points)

648
views
ugcnetjune2013iii
linearprogramming
+1
vote
1
answer
18
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
(
105k
points)

2.2k
views
ugcnetdec2012iii
operationresearch
linearprogramming
+1
vote
2
answers
19
UGCNETJune2016III70
Consider the statement "Either $2 \leq x \leq 1 \text{ or } 1 \leq x \leq 2$" The negation of this statement is x<2 or 2<x or 1<x<1 x<2 or 2<x 1<x<1 x $\leq$ 2 or 2 $\leq$ x or 1<x<1
asked
Jul 11, 2016
in
Discrete Mathematics
by
Sanjay Sharma
Boss
(
49.3k
points)

665
views
ugcnetjune2016iii
linearprogramming
+3
votes
1
answer
20
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
(
105k
points)

840
views
ugcnetjune2012iii
operationresearch
linearprogramming
+2
votes
1
answer
21
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
(
105k
points)

967
views
ugcnetjune2012iii
operationresearch
linearprogramming
0
votes
1
answer
22
linear programming ....explain it
asked
Nov 15, 2014
in
Others
by
priya023
(
185
points)

312
views
linearprogramming
nongate
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged linearprogramming
Recent Blog Comments
@!KARAN agreed, but what we can do?
RE=regular expressions which is the...
@Akash Ghosh Ofcourse I know that it is regular...
Why are you saying 2 months? Its your hard work...
@commenter commenter I also thought the same and...
50,737
questions
57,272
answers
198,145
comments
104,790
users