Register
Filter

Hot questions in Optimization

0 votes
0 answers
3
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)$
User Avatar
1 votes
1 answer
5
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
User Avatar
1 votes
1 answer
6
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
User Avatar
1 votes
1 answer
9
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
User Avatar
3 votes
1 answer
10
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...
User Avatar
1 votes
1 answer
11
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
User Avatar
1 votes
1 answer
13
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...
User Avatar
2 votes
1 answer
16
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...
User Avatar
3 votes
1 answer
18
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...
User Avatar
To see more, click for the full list of questions or popular tags.