Feasible and Infeasible Regions
Linear Inequalities and Linear Programming

88625 The coordinates of the corner points of the bounded feasible region are \((10,0),(2,4),(1,5)\) and \((0,8)\). The maximum of objective function \(z=60 x+10 y\) is

1 800
2 600
3 700
4 110
Linear Inequalities and Linear Programming

88628 The region represented by the inequalities \(x \geq\) \(6, y \geq 3,2 x+y \geq 10, x \geq 0, y \geq 0\) is

1 Origin side of all the inequalities
2 Bounded
3 Unbounded
4 A polygon
Linear Inequalities and Linear Programming

88609 The feasible region of an LPP is shown in the figure. If \(Z=11 x+7 y\), then the maximum value of \(Z\) occurs at

1 \((3,3)\)
2 \((5,0)\)
3 \((3,2)\)
4 \((0,5)\)
Linear Inequalities and Linear Programming

88610 Corner points of the feasible region determined by the system of linear constraints are \((0,3),(1\), 1) and \((3,0)\). Let \(z=p x+q y\), where \(p, q>0\). Condition on \(p\) and \(q\) so that the minimum of \(z\) occurs at \((3,0)\) and \((1,1)\) is

1 \(\mathrm{p}=\frac{\mathrm{q}}{2}\)
2 \(p=3 q\)
3 \(\mathrm{p}=\mathrm{q}\)
4 \(p=2 q\)
Linear Inequalities and Linear Programming

88612 For the following feasible region, the linear constraints are

1 \(x \geq 0, y \geq 0,3 x+2 y \geq 12, x+3 y \geq 11\)
2 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \geq 11\)
3 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \leq 11\)
4 None of these
Linear Inequalities and Linear Programming

88625 The coordinates of the corner points of the bounded feasible region are \((10,0),(2,4),(1,5)\) and \((0,8)\). The maximum of objective function \(z=60 x+10 y\) is

1 800
2 600
3 700
4 110
Linear Inequalities and Linear Programming

88628 The region represented by the inequalities \(x \geq\) \(6, y \geq 3,2 x+y \geq 10, x \geq 0, y \geq 0\) is

1 Origin side of all the inequalities
2 Bounded
3 Unbounded
4 A polygon
Linear Inequalities and Linear Programming

88609 The feasible region of an LPP is shown in the figure. If \(Z=11 x+7 y\), then the maximum value of \(Z\) occurs at

1 \((3,3)\)
2 \((5,0)\)
3 \((3,2)\)
4 \((0,5)\)
Linear Inequalities and Linear Programming

88610 Corner points of the feasible region determined by the system of linear constraints are \((0,3),(1\), 1) and \((3,0)\). Let \(z=p x+q y\), where \(p, q>0\). Condition on \(p\) and \(q\) so that the minimum of \(z\) occurs at \((3,0)\) and \((1,1)\) is

1 \(\mathrm{p}=\frac{\mathrm{q}}{2}\)
2 \(p=3 q\)
3 \(\mathrm{p}=\mathrm{q}\)
4 \(p=2 q\)
Linear Inequalities and Linear Programming

88612 For the following feasible region, the linear constraints are

1 \(x \geq 0, y \geq 0,3 x+2 y \geq 12, x+3 y \geq 11\)
2 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \geq 11\)
3 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \leq 11\)
4 None of these
Linear Inequalities and Linear Programming

88625 The coordinates of the corner points of the bounded feasible region are \((10,0),(2,4),(1,5)\) and \((0,8)\). The maximum of objective function \(z=60 x+10 y\) is

1 800
2 600
3 700
4 110
Linear Inequalities and Linear Programming

88628 The region represented by the inequalities \(x \geq\) \(6, y \geq 3,2 x+y \geq 10, x \geq 0, y \geq 0\) is

1 Origin side of all the inequalities
2 Bounded
3 Unbounded
4 A polygon
Linear Inequalities and Linear Programming

88609 The feasible region of an LPP is shown in the figure. If \(Z=11 x+7 y\), then the maximum value of \(Z\) occurs at

1 \((3,3)\)
2 \((5,0)\)
3 \((3,2)\)
4 \((0,5)\)
Linear Inequalities and Linear Programming

88610 Corner points of the feasible region determined by the system of linear constraints are \((0,3),(1\), 1) and \((3,0)\). Let \(z=p x+q y\), where \(p, q>0\). Condition on \(p\) and \(q\) so that the minimum of \(z\) occurs at \((3,0)\) and \((1,1)\) is

1 \(\mathrm{p}=\frac{\mathrm{q}}{2}\)
2 \(p=3 q\)
3 \(\mathrm{p}=\mathrm{q}\)
4 \(p=2 q\)
Linear Inequalities and Linear Programming

88612 For the following feasible region, the linear constraints are

1 \(x \geq 0, y \geq 0,3 x+2 y \geq 12, x+3 y \geq 11\)
2 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \geq 11\)
3 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \leq 11\)
4 None of these
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Linear Inequalities and Linear Programming

88625 The coordinates of the corner points of the bounded feasible region are \((10,0),(2,4),(1,5)\) and \((0,8)\). The maximum of objective function \(z=60 x+10 y\) is

1 800
2 600
3 700
4 110
Linear Inequalities and Linear Programming

88628 The region represented by the inequalities \(x \geq\) \(6, y \geq 3,2 x+y \geq 10, x \geq 0, y \geq 0\) is

1 Origin side of all the inequalities
2 Bounded
3 Unbounded
4 A polygon
Linear Inequalities and Linear Programming

88609 The feasible region of an LPP is shown in the figure. If \(Z=11 x+7 y\), then the maximum value of \(Z\) occurs at

1 \((3,3)\)
2 \((5,0)\)
3 \((3,2)\)
4 \((0,5)\)
Linear Inequalities and Linear Programming

88610 Corner points of the feasible region determined by the system of linear constraints are \((0,3),(1\), 1) and \((3,0)\). Let \(z=p x+q y\), where \(p, q>0\). Condition on \(p\) and \(q\) so that the minimum of \(z\) occurs at \((3,0)\) and \((1,1)\) is

1 \(\mathrm{p}=\frac{\mathrm{q}}{2}\)
2 \(p=3 q\)
3 \(\mathrm{p}=\mathrm{q}\)
4 \(p=2 q\)
Linear Inequalities and Linear Programming

88612 For the following feasible region, the linear constraints are

1 \(x \geq 0, y \geq 0,3 x+2 y \geq 12, x+3 y \geq 11\)
2 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \geq 11\)
3 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \leq 11\)
4 None of these
Linear Inequalities and Linear Programming

88625 The coordinates of the corner points of the bounded feasible region are \((10,0),(2,4),(1,5)\) and \((0,8)\). The maximum of objective function \(z=60 x+10 y\) is

1 800
2 600
3 700
4 110
Linear Inequalities and Linear Programming

88628 The region represented by the inequalities \(x \geq\) \(6, y \geq 3,2 x+y \geq 10, x \geq 0, y \geq 0\) is

1 Origin side of all the inequalities
2 Bounded
3 Unbounded
4 A polygon
Linear Inequalities and Linear Programming

88609 The feasible region of an LPP is shown in the figure. If \(Z=11 x+7 y\), then the maximum value of \(Z\) occurs at

1 \((3,3)\)
2 \((5,0)\)
3 \((3,2)\)
4 \((0,5)\)
Linear Inequalities and Linear Programming

88610 Corner points of the feasible region determined by the system of linear constraints are \((0,3),(1\), 1) and \((3,0)\). Let \(z=p x+q y\), where \(p, q>0\). Condition on \(p\) and \(q\) so that the minimum of \(z\) occurs at \((3,0)\) and \((1,1)\) is

1 \(\mathrm{p}=\frac{\mathrm{q}}{2}\)
2 \(p=3 q\)
3 \(\mathrm{p}=\mathrm{q}\)
4 \(p=2 q\)
Linear Inequalities and Linear Programming

88612 For the following feasible region, the linear constraints are

1 \(x \geq 0, y \geq 0,3 x+2 y \geq 12, x+3 y \geq 11\)
2 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \geq 11\)
3 \(x \geq 0, y \geq 0,3 x+2 y \leq 12, x+3 y \leq 11\)
4 None of these