Register

Recent questions tagged optimization

0 votes
0 answers
1
Mad-Easy Test-Series
Anyone please explain this .
Anyone please explain this .
User Avatar
1 votes
2 answers
2
UGC NET CSE | June 2016 | Part 3 | Question: 63
The following transportation problem : ... The above solution of a given transportation problem is Infeasible solution optimum solution non-optimum solution unbounded solution
The following transportation problem :$\begin{array}{|l|l|l|l|l|} \hline & \text{A} & \text{B} & \text{C} & \text{Supply} \\\hline \text{I} & \text{50} & \text{30} & \tex...
User Avatar
3 votes
1 answer
4
UGC NET CSE | June 2016 | Part 3 | Question: 61
The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem exists concavity convexity quadratic polyhedron
The region of feasible solution of a linear programminig problem has a ____ property in geometry, provided the feasible solution of the problem existsconcavityconvexityqu...
User Avatar
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$
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
7
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
3 votes
1 answer
14
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
0 votes
1 answer
15
UGC NET CSE | December 2014 | Part 2 | Question: 49
________ model is designed to bring prices down by increasing the number of customers who buy a particular product at once. Economic Order Quantity Inventory Data Mining Demand-Sensitive Pricing
________ model is designed to bring prices down by increasing the number of customers who buy a particular product at once.Economic Order QuantityInventory Data MiningDem...
User Avatar
1 votes
2 answers
16
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
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{...
User Avatar
1 votes
1 answer
17
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
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
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
19
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
1 votes
1 answer
21
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
3 answers
22
UGC NET CSE | June 2012 | Part 3 | Question: 62
The optimal solution of the following assignment problem using Hungarian method is ... $\text{(A)-(I), (B)-(IV), (C)-(II), (D)-(III)}$
The optimal solution of the following assignment problem using Hungarian method is$\begin{array}{|l|l|l|l|} \hline \text{ } & \text{I} & \text{II} & \text{III} & \text{IV...
User Avatar
2 votes
1 answer
24
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
To see more, click for the full list of questions or popular tags.