Mathematical Method of Linear Programming
Linear Inequalities and Linear Programming

88598 The minimum value of the function \(z=4 x+3 y\) subject to the constraints \(3 x+2 y \geq 160\), \(5 x+2 y \geq 200, \quad x+2 y \geq 80, \quad x \geq 0, \quad y \geq 0\) is

1 320
2 300
3 220
4 200
Linear Inequalities and Linear Programming

88595 The feasible region of an LPP is shown in the figure. If \(z=3 x+9 y\), then the minimum value of \(z\) occurs at

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

88596 The maximum value of \(z=3 x+4 y\) subject to the condition \(x+y \leq 40, \quad x+2 y \leq 60, \quad x, y \geq 0\) is

1 130
2 120
3 40
4 140
Linear Inequalities and Linear Programming

88597 A wholesale merchant wants to start the business of cereal with Rs. 24000. Wheat is Rs. 400 per quintal and rice is Rs. 600 per quintal. He has capacity to store 200 quintal cereal. He earns the profit Rs. 25 per quintal on wheat and \(40 \mathrm{Rs}\). per quintal on rice, then for maximum profit the objective function is

1 \(25 x+40 y\)
2 \(40 x+25 y\)
3 \(400 x+600 y\)
4 \(\frac{400}{40} x+\frac{600}{25} y\)
Linear Inequalities and Linear Programming

88600 The objective function \(z=x_{1}+x_{2}\), subject to \(x_{1}+x_{2} \leq 10,-2 x_{1}+3 x_{2} \leq 15, x_{1} \leq 6, x_{1}, x_{2} \geq 0\) has maximum value

1 At only one point
2 At only two points
3 At every point of the segment joining two points
4 At every point of the line joining two points
Linear Inequalities and Linear Programming

88598 The minimum value of the function \(z=4 x+3 y\) subject to the constraints \(3 x+2 y \geq 160\), \(5 x+2 y \geq 200, \quad x+2 y \geq 80, \quad x \geq 0, \quad y \geq 0\) is

1 320
2 300
3 220
4 200
Linear Inequalities and Linear Programming

88595 The feasible region of an LPP is shown in the figure. If \(z=3 x+9 y\), then the minimum value of \(z\) occurs at

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

88596 The maximum value of \(z=3 x+4 y\) subject to the condition \(x+y \leq 40, \quad x+2 y \leq 60, \quad x, y \geq 0\) is

1 130
2 120
3 40
4 140
Linear Inequalities and Linear Programming

88597 A wholesale merchant wants to start the business of cereal with Rs. 24000. Wheat is Rs. 400 per quintal and rice is Rs. 600 per quintal. He has capacity to store 200 quintal cereal. He earns the profit Rs. 25 per quintal on wheat and \(40 \mathrm{Rs}\). per quintal on rice, then for maximum profit the objective function is

1 \(25 x+40 y\)
2 \(40 x+25 y\)
3 \(400 x+600 y\)
4 \(\frac{400}{40} x+\frac{600}{25} y\)
Linear Inequalities and Linear Programming

88600 The objective function \(z=x_{1}+x_{2}\), subject to \(x_{1}+x_{2} \leq 10,-2 x_{1}+3 x_{2} \leq 15, x_{1} \leq 6, x_{1}, x_{2} \geq 0\) has maximum value

1 At only one point
2 At only two points
3 At every point of the segment joining two points
4 At every point of the line joining two points
Linear Inequalities and Linear Programming

88598 The minimum value of the function \(z=4 x+3 y\) subject to the constraints \(3 x+2 y \geq 160\), \(5 x+2 y \geq 200, \quad x+2 y \geq 80, \quad x \geq 0, \quad y \geq 0\) is

1 320
2 300
3 220
4 200
Linear Inequalities and Linear Programming

88595 The feasible region of an LPP is shown in the figure. If \(z=3 x+9 y\), then the minimum value of \(z\) occurs at

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

88596 The maximum value of \(z=3 x+4 y\) subject to the condition \(x+y \leq 40, \quad x+2 y \leq 60, \quad x, y \geq 0\) is

1 130
2 120
3 40
4 140
Linear Inequalities and Linear Programming

88597 A wholesale merchant wants to start the business of cereal with Rs. 24000. Wheat is Rs. 400 per quintal and rice is Rs. 600 per quintal. He has capacity to store 200 quintal cereal. He earns the profit Rs. 25 per quintal on wheat and \(40 \mathrm{Rs}\). per quintal on rice, then for maximum profit the objective function is

1 \(25 x+40 y\)
2 \(40 x+25 y\)
3 \(400 x+600 y\)
4 \(\frac{400}{40} x+\frac{600}{25} y\)
Linear Inequalities and Linear Programming

88600 The objective function \(z=x_{1}+x_{2}\), subject to \(x_{1}+x_{2} \leq 10,-2 x_{1}+3 x_{2} \leq 15, x_{1} \leq 6, x_{1}, x_{2} \geq 0\) has maximum value

1 At only one point
2 At only two points
3 At every point of the segment joining two points
4 At every point of the line joining two points
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Linear Inequalities and Linear Programming

88598 The minimum value of the function \(z=4 x+3 y\) subject to the constraints \(3 x+2 y \geq 160\), \(5 x+2 y \geq 200, \quad x+2 y \geq 80, \quad x \geq 0, \quad y \geq 0\) is

1 320
2 300
3 220
4 200
Linear Inequalities and Linear Programming

88595 The feasible region of an LPP is shown in the figure. If \(z=3 x+9 y\), then the minimum value of \(z\) occurs at

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

88596 The maximum value of \(z=3 x+4 y\) subject to the condition \(x+y \leq 40, \quad x+2 y \leq 60, \quad x, y \geq 0\) is

1 130
2 120
3 40
4 140
Linear Inequalities and Linear Programming

88597 A wholesale merchant wants to start the business of cereal with Rs. 24000. Wheat is Rs. 400 per quintal and rice is Rs. 600 per quintal. He has capacity to store 200 quintal cereal. He earns the profit Rs. 25 per quintal on wheat and \(40 \mathrm{Rs}\). per quintal on rice, then for maximum profit the objective function is

1 \(25 x+40 y\)
2 \(40 x+25 y\)
3 \(400 x+600 y\)
4 \(\frac{400}{40} x+\frac{600}{25} y\)
Linear Inequalities and Linear Programming

88600 The objective function \(z=x_{1}+x_{2}\), subject to \(x_{1}+x_{2} \leq 10,-2 x_{1}+3 x_{2} \leq 15, x_{1} \leq 6, x_{1}, x_{2} \geq 0\) has maximum value

1 At only one point
2 At only two points
3 At every point of the segment joining two points
4 At every point of the line joining two points
Linear Inequalities and Linear Programming

88598 The minimum value of the function \(z=4 x+3 y\) subject to the constraints \(3 x+2 y \geq 160\), \(5 x+2 y \geq 200, \quad x+2 y \geq 80, \quad x \geq 0, \quad y \geq 0\) is

1 320
2 300
3 220
4 200
Linear Inequalities and Linear Programming

88595 The feasible region of an LPP is shown in the figure. If \(z=3 x+9 y\), then the minimum value of \(z\) occurs at

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

88596 The maximum value of \(z=3 x+4 y\) subject to the condition \(x+y \leq 40, \quad x+2 y \leq 60, \quad x, y \geq 0\) is

1 130
2 120
3 40
4 140
Linear Inequalities and Linear Programming

88597 A wholesale merchant wants to start the business of cereal with Rs. 24000. Wheat is Rs. 400 per quintal and rice is Rs. 600 per quintal. He has capacity to store 200 quintal cereal. He earns the profit Rs. 25 per quintal on wheat and \(40 \mathrm{Rs}\). per quintal on rice, then for maximum profit the objective function is

1 \(25 x+40 y\)
2 \(40 x+25 y\)
3 \(400 x+600 y\)
4 \(\frac{400}{40} x+\frac{600}{25} y\)
Linear Inequalities and Linear Programming

88600 The objective function \(z=x_{1}+x_{2}\), subject to \(x_{1}+x_{2} \leq 10,-2 x_{1}+3 x_{2} \leq 15, x_{1} \leq 6, x_{1}, x_{2} \geq 0\) has maximum value

1 At only one point
2 At only two points
3 At every point of the segment joining two points
4 At every point of the line joining two points