0% found this document useful (0 votes)
10 views10 pages

High

The document contains multiple-choice questions and solutions related to linear programming, focusing on maximizing and minimizing objective functions at various corner points of feasible regions. It includes calculations of corresponding values for different functions and identifies maximum and minimum values for given constraints. Additionally, it discusses the significance of corner points in determining optimal solutions in linear programming problems.

Uploaded by

sharadtandihj
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
0% found this document useful (0 votes)
10 views10 pages

High

The document contains multiple-choice questions and solutions related to linear programming, focusing on maximizing and minimizing objective functions at various corner points of feasible regions. It includes calculations of corresponding values for different functions and identifies maximum and minimum values for given constraints. Additionally, it discusses the significance of corner points in determining optimal solutions in linear programming problems.

Uploaded by

sharadtandihj
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/ 10

Solutions

MCQ Questions
1. [B]

Corresponding value
Corner points
of Z = 4x + 3y

(0,0) 0

(0,40) 120

(20,40) 200

(60,20) 300 ← Maximum

(60,0) 240

Hence, maximum value of Z = 300 < 325

So, the quantity in column B is given.

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

(0,8) −32 ← Minimum

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

(0,4) −16 ← Minimum

Hence, the maximum value of F is 12.

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

CASE BASED MCQ'S


Passage -1 [10 to 14]

10. [B]

11. [D]

12. [A]

13. [B]

14. [B]

Objective function: Constraints :

Maximise 𝑍 = 22𝑥 + 18𝑦


Mathematics | Class 12 Vertices of feasible region are:

A(0,20), B(8,12), C(16,0) and O(0,0)

P(A) = 360, P(B) = 392, P(C) = 352

∴ For maximum P, Electronic machines = 8

and Manual machines = 12. Max. profit ₹392

Passage -2 [15 to 19]


15. [C]
When we solve an L.P.P. graphically, the optimal (or optimum) value of the objective function is
attained at corner points of the feasible region.

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.

Corner Points Value of 𝐙 = 𝟐𝐱 + 𝟓𝐲

(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

15𝑝 + 15𝑞 = 20𝑞 ⇒ 15𝑝 = 5𝑞 ⇒= 3𝑝

19. [B]
Construct the following table of values of the objective function:

Corner Points Value of Z = 4x + 3y

(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

Passage -3 [20 to 24]


20. [B]
Let 𝐵(𝑥, 𝑦) be the point of intersection of the given lines

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

Corner Points Value of 𝐙 = 𝟐𝐱 + 𝟓𝐲

(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]

Corner Points Value of 𝐙 = 𝟔𝐱 − 𝟗𝐲

(0,0) 0

(25,0) 150 ← Maximum

50 40
( , ) -20
3 3

(0,20) 180

24. [C]

Corner Points Value of 𝐙 = 𝟔𝐱 + 𝟑𝐲

(0,0) 0 ← Maximum

(25,0) 150

50 40
( , ) 140
3 3

(0,20) 60

Passage -4 [25 to 29]

Construct the following table of values of objective function

Corner Points Value of Z = 4x - 6y

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

= 20 − (−48) = 20 + 48 = 68 28. [C]

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]

Passage -5 [30 to 34]


30. [B]

31. [A]

32. [C]

33. [D]

34. [C]

Let the fruit grower use x bags of brand P and y bags of brand Q.

The problem can be formulated as follows:

Minimise Z = 3x + 3.5y

Subject to the constraings,

𝑥 + 2𝑦 ≥ 240
𝑥 + 0.5𝑦 ≥ 90
1.5𝑥 + 2𝑦 ≤ 310
𝑥, 𝑦 ≥0

The feasible region determined by the system of constraints is as follows:


The corner points are A(240,50), B(20,140), and C(40,100)

Z
Corner
= 3x
points
+ 3.5y

A(140,50) 595

B(20,140) 550

C(40,100) 470 ← Minimum

The minimum value of 𝑍 is 470 at (40,100).

Thus, 40 bags of brand 𝑃 and 100 bags of brand Q should be added to the garden to minimise the
amount of nitrogen.

The minimum amount of nitrogen added to the garden is 470 kg.

ASSERTION & REASON

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.

Clearly from the graph below that there is no feasible region.

Reason (R) is also 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).

You might also like