You are on page 1of 8

Solution

Class 12 - Mathematics

MATHS
1. (b) 30 packages of screws A and 20 packages of screws B; Maximum profit = Rs 410
Explanation: Let number of packages of screws A produced = x
And number of packages of screws B produced = y
Therefore , the above L.P.P. is given as :
Maximise , Z = 7x +10y , subject to the constraints : 4x +6y ≤ 240 and. 6x +3y ≤ 240 i.e. 2x +3y ≤ 120 and 2x
+y ≤ 80 , x, y ≥ 0.
Corner points Z =7 x +10 y

O( 0 , 0 ) 0

D(40,0 )     280

A(0,40) 400

B(30,20) 410…………………(Max.)
Here Z = 410 is maximum.
i.e 30 packages of screws A and 20 packages of screws B; Maximum profit = Rs 410.
2. (d) 47
Explanation:
Corner points Z = 11x + 7y

(0, 5 ) 35

(0,3) 21

(3,2 ) 47
The maximum value is 47
3. (a) – 39
Explanation: Here , Minimise Z = 13x – 15y subject to the constraints : x + y ≤ 7, 2x – 3y + 6 ≥ 0 , x ≥ 0, y ≥ 0.
Corner points Z = 13x - 15 y

C( - 3 , 0 ) -39

B (7,0) 91

D(4,3)        7
Hence the minimum value of the function is -39
4. (b) the problem is to be re-evaluated
Explanation: The optimisation of the objective function of a LPP is governed by the constraints. Therefore,
if the constraints in a linear programming problem are changed, then the problem needs to be re-
evaluated.
5. (d) 4 Pedestal lamps and 4 wooden shades; Maximum profit = Rs 32
Explanation: Let number of pedestal lamps manufactured = x
And number of wooden shades manufactured = y
Therefore , the above L.P.P. is given as :
Maximise , Z = 5x +3y , subject to the constraints : 2x +y ≤ 12 and. 3x +2y ≤ 20 , x, y ≥ 0.
Corner points Z =5x +3 y

O( 0 , 0 ) 0

D(6,0 )       30

A(0,10) 30

1/8
BHM CLASSES
B(4,4) 32…………………(Max.)
Here Z = 32 is maximum.
i.e 30 packages of screws A and 20 packages of screws B; Maximum profit = Rs 410.
i.e. 4 Pedestal lamps and 4 wooden shades; Maximum profit = Rs 32 .
q
6. (d) p =
2

Explanation: We have Z = px + qy , At ( 3, 0 ) Z = 3p ……………………………….(1)


At ( 1 , 1) Z = p + q …………………………(2) Therefore , from (1) and (2) : We have : p = q/2 .
7. (a) (0, 8)
Explanation:
Corner points Z = 3x - 4y

(0, 0) 0

(5,0) 15

(6,8)  -14

(6 ,5) -2

(4,10) -28

(0,8) -32(Min.)
The minimum value occurs at (0,8)
8. (b) at any vertex of feasible region
Explanation: In linear programming problem we substitute the coordinates of vertices of feasible region
in the objective function and then we obtain the maximum or minimum value. Therefore, the value of
objective function is maximum under linear constraints at any vertex of feasible region.
9. (c) Maximum profit = Rs 200
Explanation: Let number of rackets made = x
And number of bats made = y
Therefore , the above L.P.P. is given as :
Maximise , Z = x +y , subject to the constraints : 1.5x +3y ≤ 42 and. 3x +y ≤ 24, i.e.0.5x + y ≤ 14 i.e. x +2y ≤ 28
and 3x +y ≤ 24 , x, y ≥ 0.
Corner points Z =  x + y

O( 0 , 0 ) 0

D(0,14 )     14

A(8,0) 8

B(4,12) 16…………………(Max.)
Here Z = 16 is maximum. i.e Maximum number of rackets = 4 and number of bats = 12.
Here , profit function is P = 20x + 10y
Profit is maximum at x = 4 and y = 12 .
Therefore , maximum profit = 20(4) + 10 ( 12) = 200.i.e. Rs.200.
10. (b) 60
Explanation: Here the objective function is given by : F = 4x +6y .
Corner points Z = 4x +6 y

(0, 2 ) 12(Min.)

(3,0) 12.(Min.)

(6,0 ) 24

(6 , 8 ) 72

(0 , 5 ) 30

2/8
BHM CLASSES
Maximum of F – Minimum of F = 72 – 12 = 30 .
11. (d) 47
Explanation: We have , Maximise the function Z = 11x + 7y, subject to the constraints: x ≤ 3, y ≤ 2,x ≥ 0, y ≥
0.
Corner points Z = 11x +7 y

C(0, 0 ) 0

B (3,0) 33

D(0,2 )       14

A( 3, 2 ) 47
Hence the function has maximum value of 47
12. (c) 2x + y ≥ 10
Explanation: 2x + y ≥ 10
We need to minimize the function Z = 6x + 10y
Converting the given inequations into equations, we obtain
x = 6, y = 2, 2x + y = 10, x = 0, y = 0
These lines are drawn using a suitable scale
Scale
On X axis
1 Big division = 1 unit On Y axis
1 Big division = 1 unit

The shaded region represents the feasible region of the given LPP. We observe that the feasible region is
due to the constraint
x ≥ 6, y ≥ 2
So, the redundant constraint is 2x + y ≥ 10
13. (d) Minimum Z = 300 at (60, 0)
Explanation: Objective function is Z = 5x + 10 y ……………………(1).
The given constraints are : x + 2y ≤ 120, x + y ≥ 60, x – 2y ≥ 0, x, y ≥ 0 .
The corner points are obtained by drawing the lines x+2y =120, x+y = 60 and x-2y = 0. The points so
obtained are (60,30),(120,0), (60,0) and (40,20)
Corner points Z = 5x + 10y

D(60 ,30 ) 600

A(120,0) 600

B(60,0) 300……………………..(Min.)

C(40,20) 400
Here , Z = 300 is minimum at ( 60, 0 ).

3/8
BHM CLASSES
14. (b) open half plane not containing the origin
Explanation: open half plane not containing the origin
On putting x = 0, y = 0 in the given inequality, we get 0 > 5, which is absurd.
Therefore, the solution set of the given inequality does not include the origin.
Thus, the solution set of the given inequality consists of the open half plane not containing the origin.
15. (b) bounded in first quadrant
Explanation: Converting the given inequations into equations, we obtain
y = 6, x + y = 3, x = 0 and y = 0, y = 6 is the line passing through (0, 6) and parallel to the X axis.The
region below the line y = 6 will satisfy the given inequation.
The line x + y = 3 meets the coordinate axis at A(3, 0) and B(0, 3). Join these points to obtain the line x + y = 3
Clearly, (0, 0) satisfies the inequation x + y ≤ 3 . So, the region in x y -plane that contains the origin
represents the solution set of the given equation.
The region represented by x ≥ 0 and y ≥ 0 :
Since every point in the first quadrant satisfies these inequations. So, the first quadrant is the region
represented by the inequations.

16. (a) given by corner points of the feasible region


Explanation: It is known that the optimal value of the objective function is attained at any of the corner
point. Thus, the optimal value of the objective function is attained at the points given by corner points of
the feasible region.
17. (a) Minimum cost = Rs 104
Explanation: Let number of units of food F1 = x
And number of units of food F2 = y
Therefore , the above L.P.P. is given as :
Minimise , Z = 4x +6y , subject to the constraints : 3 x + 6y ≥ 80, 4x + 3y ≥ 100, x,y ≥ 0.,
Corner points Z =4x +6 y

B(80/3 , 0 ) 320/3

D(24,4/3 )  104…………………(Min.)

A(0,100/3) 200
Corner points Z =4x +6 y B(80/3 , 0 ) 320/3 D(24,4/3 ) 104…………………(Min.) A(0,100/3) 200
Here Z = 104 is minimum. i.e. Minimum cost = Rs 104.
18. (b) - 17
Explanation:
Corner points Z = 3x - 4y

(0, 0 ) 0

(5,0) 15(Max.)

(6,8 ) -14

(6 , 5 ) -2

4/8
BHM CLASSES
(4,10) -28

(0,8) -32……………..(Min.)
Maximum value of Z + Minimum value of Z = 15 + ( -32) = - 17 .
19. (a) None of these
Explanation: we need to maximize the function z = 4x + 3y Converting the given inequations into
equations, we obtain
3x + 2y = 160, 5x + 2y = 200, x + 2y = 80, x = 0 and y = 0
Region represented by 3x + 2y ≥ 160 :
160
The line 3x + 2y = 160 meets the coordinate axes at A ( 3
, 0) and B(0, 80) respectively. By joining these
points we obtain the line 3x + 2y = 160. Clearly (0, 0) does not satisfies the inequation 3x + 2y ≥ 160 . So, the
region in x y plane which does not contain the origin represents the solution set of the inequation 3x + 2y
≥ 160

Region represented by 5x + 2y ≥ 200 :


The line 5x + 2y = 200 meets the coordinate axes at C(40, 0) and D(0, 100) respectively. By joining these
points we obtain the line 5x + 2y = 200. Clearly (0, 0) does not satisfies the inequation 5x + 2y ≥ 200 . So, the
region which does not contain the origin represents the solution set of the inequation 5x + 2y ≥ 200.
Region represented by x + 2y ≥ 80 :
The line x + 2y = 80 meets the coordinate axes at E(80, 0) and F(0, 40) respectively. By joining these points
we obtain the line x + 2y = 80. Clearly (0, 0) does not satisfies the inequation x + 2y ≥ 80 . So, the region
which does not contain the origin represents the solution set of the inequation x + 2y ≥ 80.
Region represented by x ≥ 0 and y ≥ 0 since, every point in the first quadrant satisfies these inequations.
So, the first quadrant is the region represented by the inequations x ≥ 0, and y ≥ 0 The feasible region
determined by the system of constraints 3x + 2y ≥ 160, 5x + 2y ≥ 200, x + 2y ≥ 80, x ≥ 0, and y ≥ 0 are as
follows.

Here, we see that the feasible region is unbounded. Therefore, the maximum value is infinity.
20. (a) 1260
Explanation: We have , Maximize Z = 100x + 120y , subject to constraints 2x + 3y ≤ 30, 3x + y ≤ 17, x ≥ 0, y ≥
0.
Corner points Z = 100x +120 y

P( 0 , 0 ) 0

Q(3 , 8) 1260………………….(Max.)

R( 0, 10 )   1200

S(17/3 , 0 ) 1700/3
Hence the maximum value is 1260
8 1
21. (a) Minimum cost = Rs 160 at all points lying on segment joining ( 3 , 0) and (2,
2
)

Explanation: Let number of food type P = x


And number of units of food type Q = y

5/8
BHM CLASSES
Therefore , the above L.P.P. is given as :
Minimise , Z = 60x +80y , subject to the constraints : 3 x + 4y ≥ 8, 5x + 2y ≥ 11, x,y ≥ 0.
The corner points can be obtained by drawing the lines 3x+4y=8 and 5x+2y=11 graphically.
The points so obtained are (8/3,0), (2,1/2), (0,11/2)
Corner points Z =  - x + 2y

D(8/3,0 )    160………………….(Min.)

A(2,1/2) 160………………(Min.)

B(0,11/2) 440
Here Z = 160 is minimum. i.e. Minimum cost = Rs 160 at all points lying on segment joining
8 1
(
3
, 0) and (2,
2
) .
22. (a) 8 Souvenir of types A and 20 of Souvenir of type B; Maximum profit = Rs 160
Explanation: Let number of souvenirs of type A = x
And number of souvenirs of type B = y
Therefore , the above L.P.P. is given as :
Maximise , Z = 5x +6y , subject to the constraints : 5x +8y ≤ 200 and. 10x +8y ≤ 240 , x, y ≥ 0.
Corner points Z =5x +6 y

O( 0 , 0 ) 0

D(0,25 )     150

A(24,0) 120

B(8,20) 160…………………(Max.)
Here Z = 160 is maximum.
i.e. 8 Souvenir of types A and 20 of Souvenir of type B; Maximum profit = Rs 160.
23. (d) (40,15)
Explanation: We need to maximize the function z = x + y Converting the given inequations into equations,
we obtain
x + 2y = 70, 2x + y = 95, x = 0 and y = 0
Region represented by x + 2y ≤ 70 :
The line x + 2y = 70 meets the coordinate axes at A(70, 0) and B(0, 35) respectively. By joining these points
we obtain the line x + 2y = 70. Clearly (0, 0) satisfies the inequation x + 2y ≤ 70 . So, the region containing
the origin represents the solution set of the inequation x + 2y ≤ 70.
Region represented by 2x + y ≤ 95 :
95
The line 2x + y = 95 meets the coordinate axes at C ( 2
, 0) respectively. By joining these points we
obtain the line 2x + y = 95
Clearly (0, 0) satisfies the inequation 2x + y ≤ 95 . So, the region containing the origin represents the
solution set of the inequation 2x + y ≤ 95
Region represented by x ≥ 0 and y ≥ 0 :
since, every point in the first quadrant satisfies these inequations. So, the first quadrant is the region
represented by the inequations x ≥ 0, and y ≥ 0
The feasible region determined by the system of constraints x + 2y ≤ 70, 2x + y ≤ 95, x ≥ 0, and y ≥ 0
are as follows.

6/8
BHM CLASSES
95
The corner points of the feasible region are O(0, 0), C( 2
, 0) E(40, 15) and B(0, 35).
The value fo Z at these corner points are as follows.
Corner point : z = x  + y
O(0, 0) : 0 + 0 =  0
95 95 95
C(
2
, 0)  :  2
+ 0 =
2

E(40, 15) : 40 + 15  = 55


B(0, 35) : 0 + 35 = 35
We see that maximum value of the objective function Z is 55  which is at (40, 15).
24. i. 0.5x+y ≤ 10
ii. x + y ≤ 15
iii. 10 and 5
iv. 175
v. 250
25. i. (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.
ii. (d) From the graph of 3x + 4y < 12 it is clear that it contains the origin but not the points on the line 3x + 4y
= 12.

iii. (d) Maximum of objective function occurs at corner points.


Corner Points Value of Z = 2x + 5y

(0, 0) 0

(7, 0) 14

(6, 3) 27

(4, 5) 33 ← Maximum

(0, 6) 30

7/8
BHM CLASSES
iv. (d) Value of Z = px + qy at (15, 15) = 15p + 15q and that at (0, 20) = 20 q. According to given condition, we
have
15p + 15q = 20 q ⇒ 15p = 5q ⇒ q = 3p
v. (b) Construct the following table of values of the objective function:
Corner Points Value of Z = 2x + 5y

(0, 0) 4×0+3×0=0

(0, 40) 4 ×  20 + 3 ×  40 = 0

(20, 40) 4 × 20 + 3 × 40 = 200

(60, 20) 4 × 60 + 3 × 20 = 300 ← Maximum

(60, 0) 4 × 60 + 3 × 20 = 240

26. i. (a) 4x + 5y ≤ 120


ii. (a) (30, 0)
iii. (c) 5x + 10y
iv. (b) 250
v. (c) 170

8/8
BHM CLASSES

You might also like