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
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions in Optimization
1
vote
1
answer
1
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
14.5k
views
ugcnetcse-dec2015-paper3
optimization
linear-programming
1
vote
1
answer
2
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
go_editor
asked
in
Optimization
Jul 12, 2016
by
go_editor
13.5k
views
ugcnetcse-dec2012-paper3
optimization
dual-linear-programming
3
votes
3
answers
3
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
go_editor
asked
in
Optimization
Aug 2, 2016
by
go_editor
10.9k
views
ugcnetcse-june2015-paper3
transportation-problem
optimization
0
votes
1
answer
4
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.
makhdoom ghaya
asked
in
Optimization
Jul 11, 2016
by
makhdoom ghaya
9.8k
views
ugcnetjune2014iii
optimization
assignment-problem
3
votes
1
answer
5
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$
go_editor
asked
in
Optimization
Aug 11, 2016
by
go_editor
5.5k
views
ugcnetcse-dec2015-paper3
optimization
transportation-problem
1
vote
2
answers
6
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
go_editor
asked
in
Optimization
Jul 12, 2016
by
go_editor
4.7k
views
ugcnetcse-dec2012-paper3
optimization
transportation-problem
1
vote
1
answer
7
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
4.2k
views
ugcnetcse-dec2012-paper3
optimization
linear-programming
3
votes
1
answer
8
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
go_editor
asked
in
Optimization
Aug 2, 2016
by
go_editor
3.6k
views
ugcnetcse-june2015-paper3
assignment-problem
optimization
1
vote
1
answer
9
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
makhdoom ghaya
asked
in
Optimization
Jul 11, 2016
by
makhdoom ghaya
3.4k
views
ugcnetjune2014iii
optimization
1
vote
1
answer
10
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
makhdoom ghaya
asked
in
Optimization
Jul 11, 2016
by
makhdoom ghaya
2.9k
views
ugcnetjune2014iii
optimization
transportation-problem
2
votes
1
answer
11
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.9k
views
ugcnetcse-june2012-paper3
optimization
linear-programming
2
votes
1
answer
12
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$
go_editor
asked
in
Optimization
Aug 11, 2016
by
go_editor
2.7k
views
ugcnetcse-dec2015-paper3
optimization
transportation-problem
2
votes
1
answer
13
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.5k
views
ugcnetcse-dec2013-paper3
optimization
linear-programming
2
votes
1
answer
14
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
2.3k
views
ugcnetcse-june2015-paper3
optimization
linear-programming
3
votes
1
answer
15
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
go_editor
asked
in
Optimization
Jul 27, 2016
by
go_editor
2.3k
views
ugcnetcse-dec2013-paper3
optimization
linear-programming-problem
3
votes
2
answers
16
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
go_editor
asked
in
Optimization
Aug 11, 2016
by
go_editor
1.8k
views
ugcnetcse-dec2015-paper3
optimization
0
votes
1
answer
17
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
1.6k
views
ugcnetcse-oct2020-paper2
non-gate
linear-programming
1
vote
1
answer
18
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
admin
asked
in
Optimization
Mar 31, 2020
by
admin
1.1k
views
nielit2016mar-scientistb
non-gate
2
votes
1
answer
19
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
878
views
ugcnetcse-dec2013-paper3
optimization
linear-programming
0
votes
0
answers
20
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)$
admin
asked
in
Optimization
Aug 28, 2020
by
admin
311
views
nielit2017oct-assistanta-cs
non-gate
differential-equation
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
IS&Software Engineering
(429)
Web Technologies
(93)
Numerical Methods
(64)
Computer Graphics
(111)
Object Oriented Programming
(120)
Java
(36)
Cloud Computing
(6)
Distributed Computing
(14)
Information Theory
(6)
Optimization
(20)
Digital Image Processing
(17)
Digital Signal Processing
(34)
Computer Peripherals
(13)
Multimedia
(2)
Geometry
(54)
Integrated Circuits
(9)
Big Data Systems
(1)
Others
(412)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow