Register

Recent questions tagged linear-programming

0 votes
1 answer
2
UGC NET CSE | January 2017 | Part 3 | Question: 70
Consider the following LPP: $\begin{array}{ll} \text{Min.} Z= & x_{1}+x_{2}+x_{3} \\ \text{Subject to } & 3x_{1}+4x_{3}\leq 5 \\ & 5x_{1}+x_{2}+6x_{3}=7 \\ & 8x_{1}+9x_{3}\geq 2, \\ &x_{1},x_{2},x_{3} \geq 0 \end{array}$ ...
Consider the following LPP:$\begin{array}{ll} \text{Min.} Z= & x_{1}+x_{2}+x_{3} \\ \text{Subject to } & 3x_{1}+4x_{3}\leq 5 \\ & 5x_{1}+x_{2}+6x_{3}=7 \\ & 8x_{1}+9x_...
User Avatar
1 votes
0 answers
5
GATE CSE 1988 | Question: 2i
If the transportation problem is solved using some version of the simplex algorithm, under what condition will the solution always have integer values?
If the transportation problem is solved using some version of the simplex algorithm, under what condition will the solution always have integer values?
User Avatar
1 votes
0 answers
6
GATE CSE 1990 | Question: 1-ix
The solution to the following linear program $\max$ $X_{1}$ such that $X_{1}+2X_{2} \leq 10$ $X_{1} \leq 8$ $X_{1} \leq 1$ is ____________.
The solution to the following linear program$\max$ $X_{1}$such that $X_{1}+2X_{2} \leq 10$ $X_{1} \leq 8$ $X_{1} \leq 1$is ____________.
User Avatar
3 votes
1 answer
10
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
1 votes
1 answer
11
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
12
UGC NET CSE | December 2014 | Part 3 | Question: 67
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution is Optimum Infeasible Unbounded Degenerate
If an artificial variable is present in the ‘basic variable’ column of optimal simplex table, then the solution isOptimumInfeasible Unbounded Degenerate
User Avatar
1 votes
1 answer
16
UGC NET CSE | September 2013 | Part 3 | Question: 13
If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is Alternative solution Infeasible solution Unbounded solution Degenerate solution
If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is Alternative solutionInfeasible solutionUnbounded solutionDe...
User Avatar
1 votes
1 answer
17
UGC NET CSE | June 2013 | Part 3 | Question: 25
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel's Approximation method is ... $76$ $80$ $90$ $96$
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is$\begin{array}{|l|l|l|l...
User Avatar
2 votes
1 answer
18
UGC NET CSE | June 2013 | Part 3 | Question: 24
A basic feasible solution to a m-origin, n-destination transportation problem is said to be ______ if the number of positive allocations are less than m+n-1. degenerate non- degenerate unbounded unbalanced
A basic feasible solution to a m-origin, n-destination transportation problem is said to be ______ if the number of positive allocations are less than m+n-1.degeneratenon...
User Avatar
3 votes
1 answer
19
UGC NET CSE | June 2013 | Part 3 | Question: 23
At any iteration of simplex method if $\Delta j (Zj – Cj)$ corresponding to any non-basic variable $Xj$ is obtained as zero, the solution under the test is Degenerate solution Unbounded solution Alternative solution Optimal solution
At any iteration of simplex method if $\Delta j (Zj – Cj)$ corresponding to any non-basic variable $Xj$ is obtained as zero, the solution under the test isDegenerat...
User Avatar
1 votes
1 answer
20
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
2 votes
2 answers
21
UGC NET CSE | June 2016 | Part 3 | Question: 70
Consider the statement "Either $-2 \leq x \leq -1 \text{ or } 1 \leq x \leq 2$" The negation of this statement is x<-2 or 2<x or -1<x<1 x<-2 or 2<x -1<x<1 x $\leq$ -2 or 2 $\leq$ x or -1<x<1
Consider the statement "Either $-2 \leq x \leq -1 \text{ or } 1 \leq x \leq 2$"The negation of this statement is x<-2 or 2<x or -1<x<1x<-2 or 2<x-1<x<1x $\leq$ -2 or 2 $...
User Avatar
2 votes
1 answer
23
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
0 votes
1 answer
24
linear programming ....explain it
User Avatar
To see more, click for the full list of questions or popular tags.