menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
RANK Predictor for GATE 2021
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
Exact tag match
Recent Posts
Questions to be debated for GATE CSE 2021
MS degrees IITs - Eligibility and Procedures
Any new Pragys' out there?
GATE 2.0 (PGEE 2021)
Pragys app now live for gatecse 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3.1k)
Programming and DS
(5.2k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
IS&Software Engineering
(381)
Web Technologies
(76)
Numerical Methods
(61)
Artificial Intelligence
(40)
Computer Graphics
(107)
Object Oriented Programming
(105)
Java
(28)
Cloud Computing
(2)
Distributed Computing
(15)
Information Theory
(4)
Data Mining and Warehousing
(24)
Optimization
(19)
Digital Image Processing
(17)
Digital Signal Processing
(31)
Computer Peripherals
(13)
Multimedia
(2)
Geometry
(53)
Integrated Circuits
(8)
Big Data Systems
(1)
Others
(203)
Others
(1.5k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Follow @gateoverflow
Gatecse
Recent questions and answers in Optimization
Recent Blog Comments
https://gateoverflow.in/357468/gate-cse-2021-set-1...
For challenging the answer key we made a group...
whatsapp - 9748126819
@deba1998 please share your mail or contact, need...
Yes bro after releasing of the ans key(keeping...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Recent questions and answers in Optimization
0
votes
1
answer
1
UGCNET-Oct2020-II: 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 \geq 0 \end{array}$ The optimum value of the LP is $23$ $9.5$ $13$ $8$
answered
Nov 21, 2020
in
Optimization
Sanjay Sharma
144
views
ugcnet-oct2020-ii
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)$
asked
Aug 28, 2020
in
Optimization
Lakshman Patel RJIT
53
views
nielit2017oct-assistanta-cs
non-gate
differential-equation
0
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 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
answered
May 27, 2020
in
Optimization
Mohit Kumar 6
298
views
nielit2016mar-scientistb
non-gate
3
votes
3
answers
4
UGCNET-June2015-III: 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 below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
answered
Aug 4, 2019
in
Optimization
kmittal1908
3.9k
views
ugcnetjune2015iii
transportation-problem
optimization
1
vote
1
answer
5
UGCNET-June2014-III: 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 as 5 8 7 2 2 10 then the minimum cost is 76 78 80 82
answered
May 9, 2018
in
Optimization
Girjesh Chouhan
1.8k
views
ugcnetjune2014iii
optimization
transportation-problem
1
vote
2
answers
6
UGCNET-Dec2012-III: 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{$D_2$} & \text{$D_3$} & \text{$ ... , Total cost = 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{$D_1$} & \textbf{$D_2$} & \text{$D_3$} & \text{$D_4$} & \textbf{Supply} \\\hline \textbf{$ ... = 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
answered
Mar 27, 2018
in
Optimization
Debasmita Bhoumik
2.6k
views
ugcnetdec2012iii
optimization
transportation-problem
3
votes
2
answers
7
UGCNET-Dec2015-III: 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 variables Arithmetic equations that impose restrictions over variables Arithmetic equations that discard constraints over the given variables
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
answered
Aug 11, 2016
in
Optimization
Sanjay Sharma
955
views
ugcnetdec2015iii
optimization
3
votes
1
answer
8
UGCNET-Dec2015-III: 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 Approximation method is $1450$ $1465$ $1480$ $1520$
answered
Aug 11, 2016
in
Optimization
Sanjay Sharma
3.4k
views
ugcnetdec2015iii
optimization
transportation-problem
1
vote
1
answer
9
UGCNET-Dec2015-III: 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 zero generate degenerate infeasible unbounded
answered
Aug 11, 2016
in
Optimization
Sanjay Sharma
3.3k
views
ugcnetdec2015iii
optimization
linear-programming
2
votes
1
answer
10
UGCNET-Dec2015-III: 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 positive allocations must be ... if it satisfies: $a$ and $b$ only $a$ and $c$ only $b$ and $c$ only $a$, $b$ and $c$
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 positive allocations must be in independent ... solution if it satisfies: $a$ and $b$ only $a$ and $c$ only $b$ and $c$ only $a$, $b$ and $c$
answered
Aug 11, 2016
in
Optimization
Sanjay Sharma
1.2k
views
ugcnetdec2015iii
optimization
transportation-problem
2
votes
1
answer
11
UGCNET-June2015-III: 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 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
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 solution S3: If ... the two problems are equal. Which of the following is true? S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3
answered
Aug 2, 2016
in
Optimization
Sanjay Sharma
1.3k
views
ugcnetjune2015iii
optimization
linear-programming
3
votes
1
answer
12
UGCNET-June2015-III: 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 opportunity cost be equal to the number of rows or columns rows + columns rows + columns -1 rows + columns +1
answered
Aug 2, 2016
in
Optimization
Sanjay Sharma
1.7k
views
ugcnetjune2015iii
assignment-problem
optimization
2
votes
1
answer
13
UGCNET-Dec2013-III: 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 condition for a local ... $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-negativity constrains $x \geq 0$ ... $g_i (\bar{X}) \leq b_i, i=1,2 \dots m$ All of these
answered
Jul 28, 2016
in
Optimization
Sanjay Sharma
518
views
ugcnetdec2013iii
optimization
linear-programming
2
votes
1
answer
14
UGCNET-Dec2013-III: 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_2 \geq 0 $ Feasible solution No feasible solution Unbounded solution Single point as solution
answered
Jul 27, 2016
in
Optimization
Sanjay Sharma
1.5k
views
ugcnetdec2013iii
optimization
linear-programming
3
votes
1
answer
15
UGCNET-Dec2013-III: 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 have feasible solution alternative solution no feasible solution at all no alternative solution at all
answered
Jul 27, 2016
in
Optimization
Sanjay Sharma
1.1k
views
ugcnetdec2013iii
optimization
linear-programming-problem
1
vote
1
answer
16
UGCNET-June2014-III: 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 optimality Infeasibility Unboundedness All of the above
answered
Jul 13, 2016
in
Optimization
Sanjay Sharma
1.6k
views
ugcnetjune2014iii
optimization
0
votes
1
answer
17
UGCNET-June2014-III: 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 each entry in a column 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 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.
answered
Jul 13, 2016
in
Optimization
Sanjay Sharma
3.9k
views
ugcnetjune2014iii
optimization
assignment-problem
1
vote
1
answer
18
UGCNET-Dec2012-III: 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 are 6 8 10 12
answered
Jul 13, 2016
in
Optimization
Sanjay Sharma
2.8k
views
ugcnetdec2012iii
optimization
linear-programming
2
votes
1
answer
19
UGCNET-June2012-III: 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$ is A polygon Unbounded feasible region A point None of these
answered
Jul 7, 2016
in
Optimization
Sanjay Sharma
1.4k
views
ugcnetjune2012iii
optimization
linear-programming
Help get things started by
asking a question
.
...