Scribd
Upload
29 views2 pages

Maths Worksheet Linear Programming.

The document contains multiple-choice questions (MCQs) related to linear programming problems (LPP) and inequalities. It covers topics such as feasible regions, objective functions, and constraints, providing options for answers to each question. The questions are sourced from various terms and years, indicating a focus on mathematical concepts and problem-solving in linear programming.

Uploaded by

Ashutosh Ashutosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
29 views2 pages

Maths Worksheet Linear Programming.

The document contains multiple-choice questions (MCQs) related to linear programming problems (LPP) and inequalities. It covers topics such as feasible regions, objective functions, and constraints, providing options for answers to each question. The questions are sourced from various terms and years, indicating a focus on mathematical concepts and problem-solving in linear programming.

Uploaded by

Ashutosh Ashutosh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MCQ

1. Which of the following points satisfhes both the


inequations 2x +ys 10 and x+ 2y2 8?
(a) (-2,4) (b) (3, 2) (c) (-5,6) (d) (4,2)
(2023)(U)
2 The solution set of the inequation 3x + 5y <7 is
(a) whole xy-plane except the points lying on the
line 3x+ 5y =7.
(b) whole xy-plane along with the points lying on
the line 3x + 5y = 7.
(c) open half plane containing the origin exXCept the
points of line 3x +5y=7.
(d) open half plane not containing the origin.
(2023)(U
3 If the corner points of the feasible region of an LPP
are (0, 3), (3, 2) and (0, 5), then the minimum value of
Z= 11x + 7y is
(a) 21 (b) 33 (c) 14 (d) 35
(Term I, 2021-22) (Ev
The number of solutions of the system of
inequations x +2y s 3, 3x + 4y z 12, x 20, y z 1 is
(a) 0 (b) 2 (c) finite (d) infinite
(Term I, 2021-22) (U)
5. The maximum value of Z = 3 + 4y subject to the
constraints x >0. y z 0 and x + y s 1 is
(a) 7 (b) 4 (c) 3 (d) 10
(Tern 1, 2021-22) (Ev)
6. The feasible region of an LPP is given in the following
figure

(0. 104)
(0,38)

(52.0)
\(76., ON
Then, the constraints of the LPP are xe0. y 20 and
(a) 2x +y<52 and x+2ys 76
(b) 2x + ys 104 and x + 2ys 76
(c) x+ 2ys 104 and 2x + ys76
(d) x+ 2ys 104 and 2x + ys 38
(Term I, 2021-22) Ap
7. If the minimum value of an objective function
Z= ax+ by occurs at two points (3, 4) and (4,3) then
(a) a+b=0 (b) a=b
(c) 3a =b (d) a=3b
(Term 1, 2021-22) (U)
8. For the following LPP, maximise Z =3x+ 4y subject
to constraints x - y2 -1, xs 3, x 0. y20
the maximum value is (c) 25 (d) 30
(a) (b) 4
(Term I, 2021-22)(Ap
corner points of the feasible region determined
9 The inequalities are (0, 0). (4, 0).
by the system of linear
maximum value of z = ax +
by.
(2, 4) and (0, 5). If the
both (2, 4) and (4, ), then
where a, b > Ooccurs at (b) 2a =b
(a) a= 2b
(d) 3a=b (2020) (U)
(c) ab
LPP. if the objective function z= ax + by has the
10. In an corner points of the
same maximum value on two
number of points at which
feasible region, then the
Zmax OCCurs is
(b) 2 (c) fnite (d) infhnite
(a) 0 (2020)(U
is shown below:
11. The feasible region for an LPP function. Minimum
objective
Let z = 3x - 4y be the
of z occurs at

(4. 10)
(6.8)
(0, 8)f
6.5)

(0.0) (5,O)

(a) (0,0) (b) (0,8)


(c) (5,0)
(d) (4, 10)
(NCERT Exemplar,2020) Ap)
graph of the inequality 2x +3y >6
is
12. The the origin
(a) half plane that contains contains the origin nor
(b) half plane that neither 3y =6.
the points of the line 2x +
whole XOY-plane excluding the points on the
(c)
line 2x + 3y= 6. (2020)U
(d) entire XOY-plane.
an LPP is
13. The objective function of
(a) a constant
optimised
(b) a linear function to be
(c) an inequality (2020)(R
(d) a quadratic expression

You might also like