Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Recent questions in Optimization
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$
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 \ge...
go_editor
1.7k
views
go_editor
asked
Nov 20, 2020
Optimization
ugcnetcse-oct2020-paper2
non-gate
linear-programming
+
–
0
votes
0
answers
2
NIELIT 2017 OCT Scientific Assistant A (CS) - Section D: 6
A solution for the differential equation $x’(t) + 2x(t) = \delta(t)$ with initial condition $x(\overline{0}) = 0$ $e^{-2t}u(t)$ $e^{2t}u(t)$ $e^{-t}u(t)$ $e^{t}u(t)$
A solution for the differential equation $x’(t) + 2x(t) = \delta(t)$ with initial condition $x(\overline{0}) = 0$$e^{-2t}u(t)$$e^{2t}u(t)$$e^{-t}u(t)$$e^{t}u(t)$
admin
317
views
admin
asked
Aug 28, 2020
Optimization
nielit2017oct-assistanta-cs
non-gate
differential-equation
+
–
1
votes
1
answer
3
NIELIT 2016 MAR Scientist B - Section C: 30
Bounded minimalization is a technique for proving whether a promotive recursive function is turning computable or not proving whether a primitive recursive function is a total function or not generating primitive recursive functions generating partial recursive functions
Bounded minimalization is a technique forproving whether a promotive recursive function is turning computable or notproving whether a primitive recursive function is a to...
admin
1.1k
views
admin
asked
Mar 31, 2020
Optimization
nielit2016mar-scientistb
non-gate
+
–
3
votes
1
answer
4
UGC NET CSE | December 2015 | Part 3 | Question: 54
Consider the following transportation problem: The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximation method is $1450$ $1465$ $1480$ $1520$
Consider the following transportation problem:The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximati...
go_editor
5.6k
views
go_editor
asked
Aug 11, 2016
Optimization
ugcnetcse-dec2015-paper3
optimization
transportation-problem
+
–
2
votes
1
answer
5
UGC NET CSE | December 2015 | Part 3 | Question: 53
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+n-1$, where $m$ is the number of rows and $n$ is the number of columns All the ... : $i$ and $ii$ only $i$ and $iii$ only $ii$ and $iii$ only $i$, $ii$ and $iii$
Consider the following conditions:The solution must be feasible, i.e. it must satisfy all the supply and demand constraintsThe number of positive allocations must be equa...
go_editor
2.8k
views
go_editor
asked
Aug 11, 2016
Optimization
ugcnetcse-dec2015-paper3
optimization
transportation-problem
+
–
1
votes
1
answer
6
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
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded
go_editor
14.7k
views
go_editor
asked
Aug 11, 2016
Optimization
ugcnetcse-dec2015-paper3
optimization
linear-programming
+
–
3
votes
2
answers
7
UGC NET CSE | December 2015 | Part 3 | Question: 47
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 ... equations that impose restrictions over variables Arithmetic equations that discard constraints over the given variables
In constraint satisfaction problem, constraints can be stated asArithmetic equations and inequalities that bind the values of variablesArithmetic equations and inequaliti...
go_editor
1.8k
views
go_editor
asked
Aug 11, 2016
Optimization
ugcnetcse-dec2015-paper3
optimization
+
–
2
votes
1
answer
8
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
Given the following statements with respect to linear programming problem:S1: The dual of the dual linear programming problem is again the primal problemS2: If either the...
go_editor
2.4k
views
go_editor
asked
Aug 2, 2016
Optimization
ugcnetcse-june2015-paper3
optimization
linear-programming
+
–
3
votes
3
answers
9
UGC NET CSE | Junet 2015 | Part 3 | Question: 68
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
Consider the following transportation problem:The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given be...
go_editor
10.9k
views
go_editor
asked
Aug 2, 2016
Optimization
ugcnetcse-june2015-paper3
transportation-problem
optimization
+
–
3
votes
1
answer
10
UGC NET CSE | Junet 2015 | Part 3 | Question: 67
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
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 oppor...
go_editor
3.6k
views
go_editor
asked
Aug 2, 2016
Optimization
ugcnetcse-june2015-paper3
assignment-problem
optimization
+
–
2
votes
1
answer
11
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
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_...
go_editor
2.5k
views
go_editor
asked
Jul 27, 2016
Optimization
ugcnetcse-dec2013-paper3
optimization
linear-programming
+
–
2
votes
1
answer
12
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
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-negati...
go_editor
899
views
go_editor
asked
Jul 27, 2016
Optimization
ugcnetcse-dec2013-paper3
optimization
linear-programming
+
–
3
votes
1
answer
13
UGC NET CSE | December 2013 | Part 3 | Question: 1
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
If the primal Linear Programming problem has unbounded solution, then it's dual problem will havefeasible solutionalternative solutionno feasible solution at allno altern...
go_editor
2.3k
views
go_editor
asked
Jul 27, 2016
Optimization
ugcnetcse-dec2013-paper3
optimization
linear-programming-problem
+
–
1
votes
2
answers
14
UGC NET CSE | December 2012 | Part 3 | Question: 28
The initial basic feasible solution to the following transportation problem using Vogel's approximation method is $\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{$D_1$} & \textbf{$ ... $= 180$ None of the above
The initial basic feasible solution to the following transportation problem using Vogel’s approximation method is$\begin{array}{|c|c|c|c|c|c|} \hline \text{} & \textbf{...
go_editor
4.8k
views
go_editor
asked
Jul 12, 2016
Optimization
ugcnetcse-dec2012-paper3
optimization
transportation-problem
+
–
1
votes
1
answer
15
UGC NET CSE | December 2012 | Part 3 | Question: 24
If dual has an unbounded solution, then its corresponding primal has no feasible solution unbounded solution feasible solution none of these
If dual has an unbounded solution, then its corresponding primal hasno feasible solutionunbounded solutionfeasible solutionnone of these
go_editor
13.8k
views
go_editor
asked
Jul 12, 2016
Optimization
ugcnetcse-dec2012-paper3
optimization
dual-linear-programming
+
–
1
votes
1
answer
16
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
In a Linear Programming Problem, suppose there are three basic variables and 2 non-basic variables, then the possible number of basic solutions are681012
go_editor
4.3k
views
go_editor
asked
Jul 12, 2016
Optimization
ugcnetcse-dec2012-paper3
optimization
linear-programming
+
–
1
votes
1
answer
17
UGC NET CSE | June 2014 | Part 3 | Question: 60
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
The initial basic feasible solution of the following transportion problem:is given as5 8 7 2210then the minimum cost is767880 82
makhdoom ghaya
3.0k
views
makhdoom ghaya
asked
Jul 11, 2016
Optimization
ugcnetjune2014iii
optimization
transportation-problem
+
–
0
votes
1
answer
18
UGC NET CSE | June 2014 | Part 3 | Question: 59
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 ... from the maximum value in that column. Adding maximum value of the table to each entry in the table.
The given maximization assignment problem can be converted into a minimization problem bySubtracting each entry in a column from the maximum value in that column.Subtract...
makhdoom ghaya
9.9k
views
makhdoom ghaya
asked
Jul 11, 2016
Optimization
ugcnetjune2014iii
optimization
assignment-problem
+
–
1
votes
1
answer
19
UGC NET CSE | June 2014 | Part 3 | Question: 58
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
Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?Alternate optimalityInfeasibility UnboundednessAll of th...
makhdoom ghaya
3.5k
views
makhdoom ghaya
asked
Jul 11, 2016
Optimization
ugcnetjune2014iii
optimization
+
–
2
votes
1
answer
20
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
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$ isA polygonU...
go_editor
3.0k
views
go_editor
asked
Jul 7, 2016
Optimization
ugcnetcse-june2012-paper3
optimization
linear-programming
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register