High
High
MCQ Questions
1. [B]
Corresponding value
Corner points
of Z = 4x + 3y
(0,0) 0
(0,40) 120
(20,40) 200
(60,0) 240
2. [B]
Corresponding value
Corner points
of 𝑍 = 3x − 4y
(0,0) 0
(5,0) 15 ← Maximum
(6,5) -2
(6,8) -14
(4,10) -28
Hence, maximum value of Z occurs at (0,8) and its minimum value is (−32).
3. [A]
Maximum of Z occurs at (5,0)
4. [D]
Maximum value of Z + Minimum value of Z = 15 − 32 = −17
5. [C]
The feasible region as shown in the figure, has objective function F = 3x − 4y.
Corresponding value
Corner points
of 𝑍 = 3x − 4y
(0,0) 0
(12,6) 12 ← Maximum
6. [B]
Minimum value of 𝐹 is -16 at (0,4)
7. [D]
Corresponding value
Corner points
of Z = 4x + 6y
(0,2) 12 ← Minimum
(3,0) 12 ← Minimum
(6,0) 24
(6,8) 72 ← Maximum
(0,5) 30
Hence, minimum value of 𝐹 occurs at any points on the line segment joining the points (0,2) and
(3,0).
8. [A]
Maximum of F - Minimum of F
= 72 − 12 = 60
9. [B]
Corresponding value
Corner points
of Z = px + qy; p, q > 0
(0,3) 3q
(1,1) p+q
(3,0) 3p
So, condition of 𝑝 and 𝑞, so that the minimum of Z occurs at (3,0) and (1,1) is
p + q = 3p
⇒ 2p = q
q
∴ p=
2
10. [B]
11. [D]
12. [A]
13. [B]
14. [B]
16. [D]
From the graph of 3𝑥 + 4𝑦 < 12 it is clear that is contains the origin but not the points on the line
3𝑥 + 4𝑦 = 12.
17. [D]
Maximum of objective function occurs at corner points.
(0,0) 0
(7,0) 14
(6,3) 27
(4,5) 33 ← Maximum
(0,6) 30
18. [D]
Value of 𝑍 = 𝑝𝑥 + 𝑞𝑦 at (15,15) = 15𝑝 + 15𝑞 and that at (0,20) = 20q. According to given
condition, we have
19. [B]
Construct the following table of values of the objective function:
(0,0) 4×0+3×0 =0
4 × 0 + 3 × 40
(0,40)
= 120
4 × 20 + 3 × 40
(20,40)
= 200
4 × 60 + 3 × 20
(60,20)
= 300 ← Maximum
4 × 60 + 3 × 0
(60,0)
= 240
2x + 5y = 100
𝑥 𝑦
and + = 1 ⇒ 8𝑥 + 5𝑦 = 20
25 40
50 40
Solving (i) and (ii), we get 𝑥 = ,𝑦 =
3 3
50 40
∴ The point of intersection B(x, y) = ( , )
3 3
21. [D]
The corner points of the feasible region shown in the given graph are
22. [A]
50 40
(0,0), A(25,0), B ( , ) , C(0,20)
3 3
Here Z = x + y
(0,0) 0
(25,0) 25
50 40
( , ) 30 ← Maximum
3 3
(0,20) 20
50 40
Thus, max𝑍 = 30 occurs at point ( , )
3 3
23. [B]
(0,0) 0
50 40
( , ) -20
3 3
(0,20) 180
24. [C]
(0,0) 0 ← Maximum
(25,0) 150
50 40
( , ) 140
3 3
(0,20) 60
4×0−6×3
(0,3)
= −18
(5,0) 4 × 5 − 6 × 0 = 20
4×6−6×8
(6,8)
= −24
4×0−6×8
(0,8)
= −48
25. [D]
Minimum value of Z is -48 which occurs at (0,8)
26. [A]
Maximum value of 𝑍 is 20 , which occurs at (5,0)
27. [B]
Maximum of Z − Minimum of Z
The corner points of the feasible region are O(0,0), A(3,0), B(3,2), C(2,3), D(0,3).
29. [D]
31. [A]
32. [C]
33. [D]
34. [C]
Let the fruit grower use x bags of brand P and y bags of brand Q.
Minimise Z = 3x + 3.5y
𝑥 + 2𝑦 ≥ 240
𝑥 + 0.5𝑦 ≥ 90
1.5𝑥 + 2𝑦 ≤ 310
𝑥, 𝑦 ≥0
Z
Corner
= 3x
points
+ 3.5y
A(140,50) 595
B(20,140) 550
Thus, 40 bags of brand 𝑃 and 100 bags of brand Q should be added to the garden to minimise the
amount of nitrogen.
35. [C]
The optimal value of the objective function is attained at the corner points of feasible region.
36. [D]
The intermediate solutions of constraints must be checked by substituting them back into constraint
equations.
37. [B]
Assertion (A) is correct.
Corner points Z = 7x + y
(3,0) 21
1 5
( , ) 6
2 2
(7,9)
(0,5) 49 maximum
38. [A]
Assertion (A) and Reason (R) both are correct and Reason (R) is the correct explanation of Assertion
(A).
39. [A]
Assertion (A) and Reason (R) both are correct, Reason (R) is the correct explanation of Assertion
(A).