Feasible and Infeasible Regions
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Linear Inequalities and Linear Programming

88622 Consider a Linear Programming Problem: Minimize \(Z=5 x+3 y\), Subject to : \(3 x+y \geq 10\), \(2 x+2 y \geq 14\) and \(x+2 y \geq 9\). Which one of the following points lies outside the feasible region?

1 \((1,9)\)
2 \((4,2)\)
3 \((6,2)\)
4 \((12,2)\)
Linear Inequalities and Linear Programming

88623 The corner points of the feasible region determined by the system of linear constraints are \((0,10),(5,5),(25,20)\) and \((0,30)\). Let \(Z=\) \(\mathbf{p x}+\mathbf{q y}\), where \(\mathbf{p}, \mathbf{q}>\mathbf{0}\), Condition on \(\mathbf{p}\) and \(q\) so that the maximum of \(\mathrm{Z}\) occurs at both the points \((25,20)\) and \((0,30)\) is

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

88624 The coordinates of the corner points of the bounded feasible region are \((0,10),(5,5),(15\), \(15)\) and \((0,20)\). The maximum of the objective function \(Z=10 x+20 y\) is:

1 600
2 550
3 400
4 450
Linear Inequalities and Linear Programming

88613 If the number of available constraints is 3 and the number of parameters to be optimized is 4 , then

1 The objective function can be optimized
2 The constraint are short in number
3 The solution is problem oriented
4 None of these
Linear Inequalities and Linear Programming

88622 Consider a Linear Programming Problem: Minimize \(Z=5 x+3 y\), Subject to : \(3 x+y \geq 10\), \(2 x+2 y \geq 14\) and \(x+2 y \geq 9\). Which one of the following points lies outside the feasible region?

1 \((1,9)\)
2 \((4,2)\)
3 \((6,2)\)
4 \((12,2)\)
Linear Inequalities and Linear Programming

88623 The corner points of the feasible region determined by the system of linear constraints are \((0,10),(5,5),(25,20)\) and \((0,30)\). Let \(Z=\) \(\mathbf{p x}+\mathbf{q y}\), where \(\mathbf{p}, \mathbf{q}>\mathbf{0}\), Condition on \(\mathbf{p}\) and \(q\) so that the maximum of \(\mathrm{Z}\) occurs at both the points \((25,20)\) and \((0,30)\) is

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

88624 The coordinates of the corner points of the bounded feasible region are \((0,10),(5,5),(15\), \(15)\) and \((0,20)\). The maximum of the objective function \(Z=10 x+20 y\) is:

1 600
2 550
3 400
4 450
Linear Inequalities and Linear Programming

88613 If the number of available constraints is 3 and the number of parameters to be optimized is 4 , then

1 The objective function can be optimized
2 The constraint are short in number
3 The solution is problem oriented
4 None of these
Linear Inequalities and Linear Programming

88622 Consider a Linear Programming Problem: Minimize \(Z=5 x+3 y\), Subject to : \(3 x+y \geq 10\), \(2 x+2 y \geq 14\) and \(x+2 y \geq 9\). Which one of the following points lies outside the feasible region?

1 \((1,9)\)
2 \((4,2)\)
3 \((6,2)\)
4 \((12,2)\)
Linear Inequalities and Linear Programming

88623 The corner points of the feasible region determined by the system of linear constraints are \((0,10),(5,5),(25,20)\) and \((0,30)\). Let \(Z=\) \(\mathbf{p x}+\mathbf{q y}\), where \(\mathbf{p}, \mathbf{q}>\mathbf{0}\), Condition on \(\mathbf{p}\) and \(q\) so that the maximum of \(\mathrm{Z}\) occurs at both the points \((25,20)\) and \((0,30)\) is

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

88624 The coordinates of the corner points of the bounded feasible region are \((0,10),(5,5),(15\), \(15)\) and \((0,20)\). The maximum of the objective function \(Z=10 x+20 y\) is:

1 600
2 550
3 400
4 450
Linear Inequalities and Linear Programming

88613 If the number of available constraints is 3 and the number of parameters to be optimized is 4 , then

1 The objective function can be optimized
2 The constraint are short in number
3 The solution is problem oriented
4 None of these
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Linear Inequalities and Linear Programming

88622 Consider a Linear Programming Problem: Minimize \(Z=5 x+3 y\), Subject to : \(3 x+y \geq 10\), \(2 x+2 y \geq 14\) and \(x+2 y \geq 9\). Which one of the following points lies outside the feasible region?

1 \((1,9)\)
2 \((4,2)\)
3 \((6,2)\)
4 \((12,2)\)
Linear Inequalities and Linear Programming

88623 The corner points of the feasible region determined by the system of linear constraints are \((0,10),(5,5),(25,20)\) and \((0,30)\). Let \(Z=\) \(\mathbf{p x}+\mathbf{q y}\), where \(\mathbf{p}, \mathbf{q}>\mathbf{0}\), Condition on \(\mathbf{p}\) and \(q\) so that the maximum of \(\mathrm{Z}\) occurs at both the points \((25,20)\) and \((0,30)\) is

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

88624 The coordinates of the corner points of the bounded feasible region are \((0,10),(5,5),(15\), \(15)\) and \((0,20)\). The maximum of the objective function \(Z=10 x+20 y\) is:

1 600
2 550
3 400
4 450
Linear Inequalities and Linear Programming

88613 If the number of available constraints is 3 and the number of parameters to be optimized is 4 , then

1 The objective function can be optimized
2 The constraint are short in number
3 The solution is problem oriented
4 None of these