88614
Consider \(\frac{x}{2}+\frac{y}{4} \geq 1\) and \(\frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\). Then number of possible solutions are :
1 Zero
2 Unique
3 Infinite
4 None of these
Explanation:
(C) : Consider \(\frac{x}{2}+\frac{y}{4} \geq 1, \frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\) convert them into equation and solve them and draw the graph of these equations we get \(y=1\) and \(x=3 / 2\) From graph region is finite but numbers of possible solutions are infinite because for different values of \(x\) and \(y\) we have different or infinite numbers of solutions.
BITSAT-2014
Linear Inequalities and Linear Programming
88619
The feasible region represented \(\mathrm{x}_{1}+\mathrm{x}_{2} \leq \mathbf{1},-3 \mathrm{x}_{1}+\mathrm{x}_{2} \geq \mathbf{3},\left(\mathrm{x}_{1}, \mathrm{x}_{2} \geq 0\right)\) is
1 a polygon
2 a singleton set
3 empty set
4 None of the above
Explanation:
(C) : We have to find the feasible region represented by the given inequalities From the graph it is clear that there are no feasible region. Hence, it is an empty set.
CG PET-2008
Linear Inequalities and Linear Programming
88627
The feasible region represented by the in equations \(2 x+3 y \leq 18, x+y \geq 10, x \geq 0, y \geq 0\) is
1 unbounded
2 a finite set
3 an empty set
4 bounded
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88626
For the inequalities \(x+y \leq 3,2 x+5 y \geq 10, x \geq\) \(0, y \geq 0\), which of the following points lies in the feasible region?
1 \((2,1)\)
2 \((4,2)\)
3 \((1,2)\)
4 \((2,2)\)
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88611
If an LPP admits optimal solution at two consecutive vertices of a feasible region, then
1 the required optimal solution is at the midpoint of the line joining two points.
2 the optimal solution occurs at every point on the line joining these two points.
3 the LPP under consideration is not solvable.
4 the LPP under consideration must be reconstructed.
Explanation:
(B) : If an LPP admits optimal solution at two consecutive vertices of a feasible region, then the optimal solution occurs at every point on the line joining these two points.
88614
Consider \(\frac{x}{2}+\frac{y}{4} \geq 1\) and \(\frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\). Then number of possible solutions are :
1 Zero
2 Unique
3 Infinite
4 None of these
Explanation:
(C) : Consider \(\frac{x}{2}+\frac{y}{4} \geq 1, \frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\) convert them into equation and solve them and draw the graph of these equations we get \(y=1\) and \(x=3 / 2\) From graph region is finite but numbers of possible solutions are infinite because for different values of \(x\) and \(y\) we have different or infinite numbers of solutions.
BITSAT-2014
Linear Inequalities and Linear Programming
88619
The feasible region represented \(\mathrm{x}_{1}+\mathrm{x}_{2} \leq \mathbf{1},-3 \mathrm{x}_{1}+\mathrm{x}_{2} \geq \mathbf{3},\left(\mathrm{x}_{1}, \mathrm{x}_{2} \geq 0\right)\) is
1 a polygon
2 a singleton set
3 empty set
4 None of the above
Explanation:
(C) : We have to find the feasible region represented by the given inequalities From the graph it is clear that there are no feasible region. Hence, it is an empty set.
CG PET-2008
Linear Inequalities and Linear Programming
88627
The feasible region represented by the in equations \(2 x+3 y \leq 18, x+y \geq 10, x \geq 0, y \geq 0\) is
1 unbounded
2 a finite set
3 an empty set
4 bounded
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88626
For the inequalities \(x+y \leq 3,2 x+5 y \geq 10, x \geq\) \(0, y \geq 0\), which of the following points lies in the feasible region?
1 \((2,1)\)
2 \((4,2)\)
3 \((1,2)\)
4 \((2,2)\)
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88611
If an LPP admits optimal solution at two consecutive vertices of a feasible region, then
1 the required optimal solution is at the midpoint of the line joining two points.
2 the optimal solution occurs at every point on the line joining these two points.
3 the LPP under consideration is not solvable.
4 the LPP under consideration must be reconstructed.
Explanation:
(B) : If an LPP admits optimal solution at two consecutive vertices of a feasible region, then the optimal solution occurs at every point on the line joining these two points.
NEET Test Series from KOTA - 10 Papers In MS WORD
WhatsApp Here
Linear Inequalities and Linear Programming
88614
Consider \(\frac{x}{2}+\frac{y}{4} \geq 1\) and \(\frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\). Then number of possible solutions are :
1 Zero
2 Unique
3 Infinite
4 None of these
Explanation:
(C) : Consider \(\frac{x}{2}+\frac{y}{4} \geq 1, \frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\) convert them into equation and solve them and draw the graph of these equations we get \(y=1\) and \(x=3 / 2\) From graph region is finite but numbers of possible solutions are infinite because for different values of \(x\) and \(y\) we have different or infinite numbers of solutions.
BITSAT-2014
Linear Inequalities and Linear Programming
88619
The feasible region represented \(\mathrm{x}_{1}+\mathrm{x}_{2} \leq \mathbf{1},-3 \mathrm{x}_{1}+\mathrm{x}_{2} \geq \mathbf{3},\left(\mathrm{x}_{1}, \mathrm{x}_{2} \geq 0\right)\) is
1 a polygon
2 a singleton set
3 empty set
4 None of the above
Explanation:
(C) : We have to find the feasible region represented by the given inequalities From the graph it is clear that there are no feasible region. Hence, it is an empty set.
CG PET-2008
Linear Inequalities and Linear Programming
88627
The feasible region represented by the in equations \(2 x+3 y \leq 18, x+y \geq 10, x \geq 0, y \geq 0\) is
1 unbounded
2 a finite set
3 an empty set
4 bounded
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88626
For the inequalities \(x+y \leq 3,2 x+5 y \geq 10, x \geq\) \(0, y \geq 0\), which of the following points lies in the feasible region?
1 \((2,1)\)
2 \((4,2)\)
3 \((1,2)\)
4 \((2,2)\)
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88611
If an LPP admits optimal solution at two consecutive vertices of a feasible region, then
1 the required optimal solution is at the midpoint of the line joining two points.
2 the optimal solution occurs at every point on the line joining these two points.
3 the LPP under consideration is not solvable.
4 the LPP under consideration must be reconstructed.
Explanation:
(B) : If an LPP admits optimal solution at two consecutive vertices of a feasible region, then the optimal solution occurs at every point on the line joining these two points.
88614
Consider \(\frac{x}{2}+\frac{y}{4} \geq 1\) and \(\frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\). Then number of possible solutions are :
1 Zero
2 Unique
3 Infinite
4 None of these
Explanation:
(C) : Consider \(\frac{x}{2}+\frac{y}{4} \geq 1, \frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\) convert them into equation and solve them and draw the graph of these equations we get \(y=1\) and \(x=3 / 2\) From graph region is finite but numbers of possible solutions are infinite because for different values of \(x\) and \(y\) we have different or infinite numbers of solutions.
BITSAT-2014
Linear Inequalities and Linear Programming
88619
The feasible region represented \(\mathrm{x}_{1}+\mathrm{x}_{2} \leq \mathbf{1},-3 \mathrm{x}_{1}+\mathrm{x}_{2} \geq \mathbf{3},\left(\mathrm{x}_{1}, \mathrm{x}_{2} \geq 0\right)\) is
1 a polygon
2 a singleton set
3 empty set
4 None of the above
Explanation:
(C) : We have to find the feasible region represented by the given inequalities From the graph it is clear that there are no feasible region. Hence, it is an empty set.
CG PET-2008
Linear Inequalities and Linear Programming
88627
The feasible region represented by the in equations \(2 x+3 y \leq 18, x+y \geq 10, x \geq 0, y \geq 0\) is
1 unbounded
2 a finite set
3 an empty set
4 bounded
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88626
For the inequalities \(x+y \leq 3,2 x+5 y \geq 10, x \geq\) \(0, y \geq 0\), which of the following points lies in the feasible region?
1 \((2,1)\)
2 \((4,2)\)
3 \((1,2)\)
4 \((2,2)\)
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88611
If an LPP admits optimal solution at two consecutive vertices of a feasible region, then
1 the required optimal solution is at the midpoint of the line joining two points.
2 the optimal solution occurs at every point on the line joining these two points.
3 the LPP under consideration is not solvable.
4 the LPP under consideration must be reconstructed.
Explanation:
(B) : If an LPP admits optimal solution at two consecutive vertices of a feasible region, then the optimal solution occurs at every point on the line joining these two points.
88614
Consider \(\frac{x}{2}+\frac{y}{4} \geq 1\) and \(\frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\). Then number of possible solutions are :
1 Zero
2 Unique
3 Infinite
4 None of these
Explanation:
(C) : Consider \(\frac{x}{2}+\frac{y}{4} \geq 1, \frac{x}{3}+\frac{y}{2} \leq 1, \quad x, y \geq 0\) convert them into equation and solve them and draw the graph of these equations we get \(y=1\) and \(x=3 / 2\) From graph region is finite but numbers of possible solutions are infinite because for different values of \(x\) and \(y\) we have different or infinite numbers of solutions.
BITSAT-2014
Linear Inequalities and Linear Programming
88619
The feasible region represented \(\mathrm{x}_{1}+\mathrm{x}_{2} \leq \mathbf{1},-3 \mathrm{x}_{1}+\mathrm{x}_{2} \geq \mathbf{3},\left(\mathrm{x}_{1}, \mathrm{x}_{2} \geq 0\right)\) is
1 a polygon
2 a singleton set
3 empty set
4 None of the above
Explanation:
(C) : We have to find the feasible region represented by the given inequalities From the graph it is clear that there are no feasible region. Hence, it is an empty set.
CG PET-2008
Linear Inequalities and Linear Programming
88627
The feasible region represented by the in equations \(2 x+3 y \leq 18, x+y \geq 10, x \geq 0, y \geq 0\) is
1 unbounded
2 a finite set
3 an empty set
4 bounded
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88626
For the inequalities \(x+y \leq 3,2 x+5 y \geq 10, x \geq\) \(0, y \geq 0\), which of the following points lies in the feasible region?
1 \((2,1)\)
2 \((4,2)\)
3 \((1,2)\)
4 \((2,2)\)
Explanation:
(C) :
MHT CET-2022
Linear Inequalities and Linear Programming
88611
If an LPP admits optimal solution at two consecutive vertices of a feasible region, then
1 the required optimal solution is at the midpoint of the line joining two points.
2 the optimal solution occurs at every point on the line joining these two points.
3 the LPP under consideration is not solvable.
4 the LPP under consideration must be reconstructed.
Explanation:
(B) : If an LPP admits optimal solution at two consecutive vertices of a feasible region, then the optimal solution occurs at every point on the line joining these two points.
