Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged linear-programming
0
votes
1
answer
1
UGC NET CSE | October 2020 | Part 2 | Question: 4
Consider the following linear programming (LP): $\begin{array}{ll} \text{Max.} & z=2x_1+3x_2 \\ \text{Such that} & 2x_1+x_2 \leq 4 \\ & x_1 + 2x_2 \leq 5 \\ & x_1, x_2 \geq 0 \end{array}$ The optimum value of the LP is $23$ $9.5$ $13$ $8$
go_editor
asked
in
Optimization
Nov 20, 2020
by
go_editor
983
views
ugcnetcse-oct2020-paper2
non-gate
linear-programming
0
votes
1
answer
2
UGC NET CSE | January 2017 | Part 3 | Question: 70
Consider the following LPP: $\begin{array}{ll} \text{Min.} Z= & x_{1}+x_{2}+x_{3} \\ \text{Subject to } & 3x_{1}+4x_{3}\leq 5 \\ & 5x_{1}+x_{2}+6x_{3}=7 \\ & 8x_{1}+9x_{3}\geq 2, \\ &x_{1},x_{2},x_{3} \geq 0 \end{array}$ ...
go_editor
asked
in
Others
Mar 24, 2020
by
go_editor
287
views
ugcnetcse-jan2017-paper3
linear-programming
1
vote
2
answers
3
UGC NET CSE | July 2018 | Part 2 | Question: 83
The following LLP $\text{Maximize } z=100x_1 +2x_2+5x_3$ Subject to $14x_1+x_2-6x_33+3x_4=7$ $32x_1+x_2-12x_3 \leq 10$ $3x_1-x_2-x_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$
Pooja Khatri
asked
in
Others
Jul 13, 2018
by
Pooja Khatri
1.5k
views
ugcnetcse-july2018-paper2
llp
linear-programming
1
vote
0
answers
4
GATE CSE 1988 | Question: 17i-ii-iii
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 ... . For the solution of (ii) above, calculate the values of the duals and determine whether this is an optimal solution.
go_editor
asked
in
Others
Dec 20, 2016
by
go_editor
379
views
gate1988
linear-programming
descriptive
out-of-gate-syllabus
1
vote
0
answers
5
GATE CSE 1988 | Question: 2i
If the transportation problem is solved using some version of the simplex algorithm, under what condition will the solution always have integer values?
go_editor
asked
in
Others
Dec 11, 2016
by
go_editor
269
views
gate1988
linear-programming
descriptive
out-of-gate-syllabus
1
vote
0
answers
6
GATE CSE 1990 | Question: 1-ix
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 ____________.
makhdoom ghaya
asked
in
Others
Nov 19, 2016
by
makhdoom ghaya
281
views
gate1990
descriptive
linear-programming
out-of-gate-syllabus
fill-in-the-blanks
2
votes
1
answer
7
UGC NET CSE | August 2016 | Part 3 | Question: 63
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 ... a) and (b) only (a) and (c) only (b) and (c) only (a), (b) and (c)
makhdoom ghaya
asked
in
Others
Oct 4, 2016
by
makhdoom ghaya
4.5k
views
ugcnetcse-aug2016-paper3
linear-programming
transportation-problem
1
vote
1
answer
8
UGC NET CSE | August 2016 | Part 3 | Question: 62
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. ... ? (a) and (b) only (a) and (c) only (b) and (c) only (a), (b) and (c)
makhdoom ghaya
asked
in
Others
Oct 4, 2016
by
makhdoom ghaya
2.0k
views
ugcnetcse-aug2016-paper3
linear-programming
duality
2
votes
1
answer
9
UGC NET CSE | August 2016 | Part 3 | Question: 61
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$
makhdoom ghaya
asked
in
Others
Oct 4, 2016
by
makhdoom ghaya
1.3k
views
ugcnetcse-aug2016-paper3
linear-programming
3
votes
1
answer
10
UGC NET CSE | June 2016 | Part 3 | Question: 61
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
go_editor
asked
in
Others
Aug 21, 2016
by
go_editor
1.4k
views
ugcnetcse-june2016-paper3
optimization
linear-programming
1
vote
1
answer
11
UGC NET CSE | December 2015 | Part 3 | Question: 52
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
go_editor
asked
in
Optimization
Aug 11, 2016
by
go_editor
11.8k
views
ugcnetcse-dec2015-paper3
optimization
linear-programming
1
vote
1
answer
12
UGC NET CSE | December 2014 | Part 3 | Question: 67
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is Optimum Infeasible Unbounded Degenerate
makhdoom ghaya
asked
in
Others
Aug 2, 2016
by
makhdoom ghaya
7.0k
views
ugcnetcse-dec2014-paper3
linear-programming
simplex-method
2
votes
1
answer
13
UGC NET CSE | Junet 2015 | Part 3 | Question: 69
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 ... are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
go_editor
asked
in
Optimization
Aug 2, 2016
by
go_editor
1.9k
views
ugcnetcse-june2015-paper3
optimization
linear-programming
2
votes
1
answer
14
UGC NET CSE | December 2013 | Part 3 | Question: 3
The following Linear Programming problem has: $\text{Max} \quad Z=x_1+x_2$ Subject to $\quad x_1-x_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
go_editor
asked
in
Optimization
Jul 27, 2016
by
go_editor
2.2k
views
ugcnetcse-dec2013-paper3
optimization
linear-programming
2
votes
1
answer
15
UGC NET CSE | December 2013 | Part 3 | Question: 2
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 non-negativity constrains $x \geq 0$. Which of the following conditions is a Kuhn-Tucker necessary ... $g_i (\bar{X}) \leq b_i, i=1,2 \dots m$ All of these
go_editor
asked
in
Optimization
Jul 27, 2016
by
go_editor
692
views
ugcnetcse-dec2013-paper3
optimization
linear-programming
1
vote
1
answer
16
UGC NET CSE | September 2013 | Part 3 | Question: 13
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
go_editor
asked
in
Artificial Intelligence
Jul 22, 2016
by
go_editor
1.2k
views
ugcnetcse-sep2013-paper3
artificial-intelligence
linear-programming
1
vote
1
answer
17
UGC NET CSE | June 2013 | Part 3 | Question: 25
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel's Approximation method is ... $76$ $80$ $90$ $96$
go_editor
asked
in
Others
Jul 16, 2016
by
go_editor
4.1k
views
ugcnetcse-june2013-paper3
linear-programming
transportation-problem
2
votes
1
answer
18
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
go_editor
asked
in
Others
Jul 16, 2016
by
go_editor
5.9k
views
ugcnetcse-june2013-paper3
linear-programming
transportation-problem
3
votes
1
answer
19
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
go_editor
asked
in
Others
Jul 16, 2016
by
go_editor
3.4k
views
ugcnetcse-june2013-paper3
linear-programming
1
vote
1
answer
20
UGC NET CSE | December 2012 | Part 3 | Question: 18
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are 6 8 10 12
go_editor
asked
in
Optimization
Jul 12, 2016
by
go_editor
3.7k
views
ugcnetcse-dec2012-paper3
optimization
linear-programming
2
votes
2
answers
21
UGC NET CSE | June 2016 | Part 3 | Question: 70
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
Sanjay Sharma
asked
in
Discrete Mathematics
Jul 11, 2016
by
Sanjay Sharma
2.4k
views
ugcnetcse-june2016-paper3
linear-programming
3
votes
1
answer
22
UGC NET CSE | June 2012 | Part 3 | Question: 49
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 non-existing solution
go_editor
asked
in
IS&Software Engineering
Jul 7, 2016
by
go_editor
4.9k
views
ugcnetcse-june2012-paper3
optimization
linear-programming
2
votes
1
answer
23
UGC NET CSE | June 2012 | Part 3 | Question: 46
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
go_editor
asked
in
Optimization
Jul 7, 2016
by
go_editor
2.3k
views
ugcnetcse-june2012-paper3
optimization
linear-programming
0
votes
1
answer
24
linear programming ....explain it
priya023
asked
in
Others
Nov 15, 2014
by
priya023
498
views
linear-programming
non-gate
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged linear-programming
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...