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 and answers 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$
Sanjay Sharma
answered
in
Optimization
Nov 21, 2020
by
Sanjay Sharma
995
views
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)$
Lakshman Patel RJIT
asked
in
Optimization
Aug 28, 2020
by
Lakshman Patel RJIT
166
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
Mohit Kumar 6
answered
in
Optimization
May 27, 2020
by
Mohit Kumar 6
692
views
nielit2016mar-scientistb
non-gate
3
votes
3
answers
4
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
kmittal1908
answered
in
Optimization
Aug 4, 2019
by
kmittal1908
10.0k
views
ugcnetcse-june2015-paper3
transportation-problem
optimization
1
vote
1
answer
5
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
Girjesh Chouhan
answered
in
Optimization
May 9, 2018
by
Girjesh Chouhan
2.4k
views
ugcnetjune2014iii
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
Debasmita Bhoumik
answered
in
Optimization
Mar 27, 2018
by
Debasmita Bhoumik
4.1k
views
ugcnetcse-dec2012-paper3
optimization
transportation-problem
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
Sanjay Sharma
answered
in
Optimization
Aug 11, 2016
by
Sanjay Sharma
1.3k
views
ugcnetcse-dec2015-paper3
optimization
3
votes
1
answer
8
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$
Sanjay Sharma
answered
in
Optimization
Aug 11, 2016
by
Sanjay Sharma
4.9k
views
ugcnetcse-dec2015-paper3
optimization
transportation-problem
1
vote
1
answer
9
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
Sanjay Sharma
answered
in
Optimization
Aug 11, 2016
by
Sanjay Sharma
11.9k
views
ugcnetcse-dec2015-paper3
optimization
linear-programming
2
votes
1
answer
10
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 ... satisfies: $a$ and $b$ only $a$ and $c$ only $b$ and $c$ only $a$, $b$ and $c$
Sanjay Sharma
answered
in
Optimization
Aug 11, 2016
by
Sanjay Sharma
2.0k
views
ugcnetcse-dec2015-paper3
optimization
transportation-problem
2
votes
1
answer
11
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
Sanjay Sharma
answered
in
Optimization
Aug 2, 2016
by
Sanjay Sharma
1.9k
views
ugcnetcse-june2015-paper3
optimization
linear-programming
3
votes
1
answer
12
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
Sanjay Sharma
answered
in
Optimization
Aug 2, 2016
by
Sanjay Sharma
2.9k
views
ugcnetcse-june2015-paper3
assignment-problem
optimization
2
votes
1
answer
13
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
Sanjay Sharma
answered
in
Optimization
Jul 28, 2016
by
Sanjay Sharma
694
views
ugcnetcse-dec2013-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
Sanjay Sharma
answered
in
Optimization
Jul 27, 2016
by
Sanjay Sharma
2.2k
views
ugcnetcse-dec2013-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
Sanjay Sharma
answered
in
Optimization
Jul 27, 2016
by
Sanjay Sharma
2.0k
views
ugcnetcse-dec2013-paper3
optimization
linear-programming-problem
1
vote
1
answer
16
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
Sanjay Sharma
answered
in
Optimization
Jul 13, 2016
by
Sanjay Sharma
2.9k
views
ugcnetjune2014iii
optimization
0
votes
1
answer
17
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.
Sanjay Sharma
answered
in
Optimization
Jul 13, 2016
by
Sanjay Sharma
9.3k
views
ugcnetjune2014iii
optimization
assignment-problem
1
vote
1
answer
18
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
Sanjay Sharma
answered
in
Optimization
Jul 13, 2016
by
Sanjay Sharma
3.7k
views
ugcnetcse-dec2012-paper3
optimization
linear-programming
1
vote
1
answer
19
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
Sanjay Sharma
answered
in
Optimization
Jul 12, 2016
by
Sanjay Sharma
11.6k
views
ugcnetcse-dec2012-paper3
optimization
dual-linear-programming
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
Sanjay Sharma
answered
in
Optimization
Jul 7, 2016
by
Sanjay Sharma
2.3k
views
ugcnetcse-june2012-paper3
optimization
linear-programming
Help get things started by
asking a question
.
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
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)
IS&Software Engineering
(383)
Web Technologies
(81)
Numerical Methods
(59)
Artificial Intelligence
(50)
Computer Graphics
(107)
Object Oriented Programming
(106)
Java
(34)
Cloud Computing
(3)
Distributed Computing
(14)
Information Theory
(4)
Data Mining and Warehousing
(23)
Optimization
(20)
Digital Image Processing
(17)
Digital Signal Processing
(33)
Computer Peripherals
(13)
Multimedia
(2)
Geometry
(53)
Integrated Circuits
(9)
Big Data Systems
(1)
Others
(321)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent questions and answers in Optimization
Recent Blog Comments
please add GO Classes 2023 Computer Networks...
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...