Different Types of Linear Programming Problems
Linear Inequalities and Linear Programming

88576 The feasible region of L.P.P.
Maximum \(\quad Z=70 x+50 y\) subject
to
\(8 x+5 y \leq 60,4 x+5 y \leq 40\) and \(x \geq 0, y \geq 0\)

1 A triangle
2 A pentagon
3 A square
4 A quadrilateral
Linear Inequalities and Linear Programming

88578 The constraints
\(-x_{1}+x_{2} \leq 1,-x_{1}+3 x_{2} \leq 9, x_{1}, x_{2}>0\) are defined on

1 bounded Feasible space
2 Unbounded feasible space
3 both bounded and unbounded feasible space
4 None of these
Linear Inequalities and Linear Programming

88579 The maximum of \(z=5 x+2 y\), subject to the constraints \(x+y \leq 7, x+2 y \leq 10, x, y \geq 0\) is

1 10
2 26
3 35
4 70
Linear Inequalities and Linear Programming

88580 The minimum value of the objective function \(z=2 x+10 y\) for linear constraints \(x \geq 0, y \geq 0, x-y \geq 0, x-5 y \geq-5\) is

1 0
2 15
3 12
4 8
NEET Test Series from KOTA - 10 Papers In MS WORD WhatsApp Here
Linear Inequalities and Linear Programming

88576 The feasible region of L.P.P.
Maximum \(\quad Z=70 x+50 y\) subject
to
\(8 x+5 y \leq 60,4 x+5 y \leq 40\) and \(x \geq 0, y \geq 0\)

1 A triangle
2 A pentagon
3 A square
4 A quadrilateral
Linear Inequalities and Linear Programming

88578 The constraints
\(-x_{1}+x_{2} \leq 1,-x_{1}+3 x_{2} \leq 9, x_{1}, x_{2}>0\) are defined on

1 bounded Feasible space
2 Unbounded feasible space
3 both bounded and unbounded feasible space
4 None of these
Linear Inequalities and Linear Programming

88579 The maximum of \(z=5 x+2 y\), subject to the constraints \(x+y \leq 7, x+2 y \leq 10, x, y \geq 0\) is

1 10
2 26
3 35
4 70
Linear Inequalities and Linear Programming

88580 The minimum value of the objective function \(z=2 x+10 y\) for linear constraints \(x \geq 0, y \geq 0, x-y \geq 0, x-5 y \geq-5\) is

1 0
2 15
3 12
4 8
Linear Inequalities and Linear Programming

88576 The feasible region of L.P.P.
Maximum \(\quad Z=70 x+50 y\) subject
to
\(8 x+5 y \leq 60,4 x+5 y \leq 40\) and \(x \geq 0, y \geq 0\)

1 A triangle
2 A pentagon
3 A square
4 A quadrilateral
Linear Inequalities and Linear Programming

88578 The constraints
\(-x_{1}+x_{2} \leq 1,-x_{1}+3 x_{2} \leq 9, x_{1}, x_{2}>0\) are defined on

1 bounded Feasible space
2 Unbounded feasible space
3 both bounded and unbounded feasible space
4 None of these
Linear Inequalities and Linear Programming

88579 The maximum of \(z=5 x+2 y\), subject to the constraints \(x+y \leq 7, x+2 y \leq 10, x, y \geq 0\) is

1 10
2 26
3 35
4 70
Linear Inequalities and Linear Programming

88580 The minimum value of the objective function \(z=2 x+10 y\) for linear constraints \(x \geq 0, y \geq 0, x-y \geq 0, x-5 y \geq-5\) is

1 0
2 15
3 12
4 8
Linear Inequalities and Linear Programming

88576 The feasible region of L.P.P.
Maximum \(\quad Z=70 x+50 y\) subject
to
\(8 x+5 y \leq 60,4 x+5 y \leq 40\) and \(x \geq 0, y \geq 0\)

1 A triangle
2 A pentagon
3 A square
4 A quadrilateral
Linear Inequalities and Linear Programming

88578 The constraints
\(-x_{1}+x_{2} \leq 1,-x_{1}+3 x_{2} \leq 9, x_{1}, x_{2}>0\) are defined on

1 bounded Feasible space
2 Unbounded feasible space
3 both bounded and unbounded feasible space
4 None of these
Linear Inequalities and Linear Programming

88579 The maximum of \(z=5 x+2 y\), subject to the constraints \(x+y \leq 7, x+2 y \leq 10, x, y \geq 0\) is

1 10
2 26
3 35
4 70
Linear Inequalities and Linear Programming

88580 The minimum value of the objective function \(z=2 x+10 y\) for linear constraints \(x \geq 0, y \geq 0, x-y \geq 0, x-5 y \geq-5\) is

1 0
2 15
3 12
4 8