Register

Recent questions and answers in Optimization

1.8k
views
1 answers
0 votes
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$
User Avatar
327
views
0 answers
0 votes
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)$
User Avatar
1.2k
views
1 answers
1 votes
NIELIT 2016 MAR Scientist B - Section C: 30
Bounded minimalization is a technique forproving whether a promotive recursive function is turning computable or notproving whether a ... function or notgenerating primitive recursive functionsgenerating partial recursive functions
User Avatar
11.1k
views
3 answers
3 votes
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 ... problem:is degenerate solutionis optimum solutionneeds to improveis infeasible solution
User Avatar
3.1k
views
1 answers
1 votes
UGC NET CSE | June 2014 | Part 3 | Question: 60
The initial basic feasible solution of the following transportion problem:is given as5 8 7 2210then the minimum cost is767880 82
User Avatar
4.9k
views
2 answers
1 votes
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{$ ... $= 180$None of the above
User Avatar
1.9k
views
2 answers
3 votes
UGC NET CSE | December 2015 | Part 3 | Question: 47
In constraint satisfaction problem, constraints can be stated asArithmetic equations and inequalities that bind the values of variablesArithmetic ... over variablesArithmetic equations that discard constraints over the given variables
User Avatar
5.7k
views
1 answers
3 votes
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$
User Avatar
14.8k
views
1 answers
1 votes
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 zerogeneratedegenerateinfeasibleunbounded
User Avatar
2.9k
views
1 answers
2 votes
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 constraintsThe number of positive allocations must be equal to $m+n-1$ ... and $iii$ only$ii$ and $iii$ only$i$, $ii$ and $iii$
User Avatar
2.4k
views
1 answers
2 votes
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 problemS2: If either the ... the following is true?S1 and S2S1 and S3S2 and S3S1, S2 and S3
User Avatar
3.7k
views
1 answers
3 votes
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 ... number ofrows or columnsrows + columnsrows + columns -1rows + columns +1
User Avatar
932
views
1 answers
2 votes
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- ... i=1,2 \dots m$g_i (\bar{X}) \leq b_i, i=1,2 \dots m$All of these
User Avatar
2.5k
views
1 answers
2 votes
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 - ... Feasible solutionNo feasible solutionUnbounded solutionSingle point as solution
User Avatar
2.4k
views
1 answers
3 votes
UGC NET CSE | December 2013 | Part 3 | Question: 1
If the primal Linear Programming problem has unbounded solution, then it's dual problem will havefeasible solutionalternative solutionno feasible solution at allno alternative solution at all
User Avatar
3.6k
views
1 answers
1 votes
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 optimalityInfeasibility UnboundednessAll of the above
User Avatar
10.0k
views
1 answers
0 votes
UGC NET CSE | June 2014 | Part 3 | Question: 59
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.Subtracting ... Adding maximum value of the table to each entry in the table.
User Avatar
4.4k
views
1 answers
1 votes
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 are681012
User Avatar
14.2k
views
1 answers
1 votes
UGC NET CSE | December 2012 | Part 3 | Question: 24
If dual has an unbounded solution, then its corresponding primal hasno feasible solutionunbounded solutionfeasible solutionnone of these
User Avatar
3.1k
views
1 answers
2 votes
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$ isA polygonUnbounded feasible regionA pointNone of these
User Avatar
Help get things started by asking a question.