Previous year Questions

Unit – 8 (Linear Programming Problem)

Q1. A dietician wishes to mix two types of food F1 and F2 in such a way that the vitamin contents of
the mixture contain atleast 8 units of vitamin A, and 10 units of vitamin C Food I contains 2 units/kg of
vitamin A and 1 unit/kg of vitamin C. Food Il contains 1 unit/kg of vitamin A and 2 units/kg of vitamin
C. It costs Rs 5 per kg to purchase food F1 and Rs 7 per kg to purchase F2.
Based on the above information , answer the following question
(a) To find out the minimum cost of such a mixture, formulate the above problem as a LPP.
(b) Determine the minimum cost of the mixture . (2022), (2022 comptt)
Solution : Let food I & food II be x and y unit respectively

Food (I)(x unit) Food(II)(Y unit)

Vitamin A 2 1 ≥8
Vitamin C 1 2 ≥10
2x+y ≥ 8--------(I) X+2y ≥ 10------(II) X,y ≥ 0------(III)
Z =5x+7y

.
From (i) & (ii) we get A(2,4)
;shaded region is required feasible region (unbounded)
CORNER POINT Z=50X+70Y
(0,8) 56
(2,4) 38-----MIN
(10,0) 50
Fesible region is unbounded so we draw 5x+7y ≤ 38 I.e. has no commom point with feasible region.
minimum cost is ₹ 380 if 2kg of food I and 4kg of food II
Q2. A diet for a sick person must contain atleat 4,000 units of vitamins , 50 units of minerals and 1400
unit of calories . Two food x and y are available at a cost of Rs 4 and Rs 3 per unit respectively . one
unit of food X contain 200 unit of vitamin , 1 unit of mineral and 40 unit of calories . whereas one unit
of food Y contain 100 unit of vitamin , 2 unit of mineral and 40 unit of calories ,
Based on the above information answer the given questions :
(i) To minimize the cost of diet, formulate the above problem as LPP.
(ii) Determine the number of unit of each food required to satisfy the requirement . (2022 comptt)
Solution : (I) Let Two foods X and Y are available at a cost of Rs. 4 and Rs. 3 per unit respectively.
So, total cost will be c=4x+3y.
Forming the inequality for vitamins, we get 200x+100y ≥ 4000 2x+y ≥ 40.
Forming the inequality for minerals, we get x+2y ≥ 50.
Forming the inequality for calories, we get 40x+40y ≥ 1400. x+y ≥ 35
(ii) We draw the lines on graph to get the intersecting points as A(0,40), B(5,30), C(20,15), D(50,0).

we find the minimum value possible for c=4x+3y at those points.

At A(0,40) we get c = 3 × 40 = 120. At B(5,30) we get c = 4×5 + 3×30 = 110
At C(20,15) we get c = 4×20 + 3×15 = 125 At D(50,0) we get c = 4×50 = 200
So, the least value is achieved at B(5,30).
Because the shaded region is unbounded, we draw an inequality for 4x + 3y < 110 which does not pass
through shaded region. Therefore, the combination of X and Y that should be used to have the least cost
is 5 and 30 units respectively. Also, the least cost is Rs. 110.
Q3. Region represented by x ≥ 0, y ≥ 0 lies in
(a) I quadrant (b) II quadrant (c) III quadrant (d) IV quadrant (2022)
Solution : Correct option is (a)
Q4. Maximise z = 300x + 190y subject to constraints : x + y ≤ 24, 2x + y ≤ 32, x ≥ 0, y ≥ 0.
(2023)
Solution : (0,32)

(0,24) (8,16)

(16,0)

Corner point 300x + 190y

(0,24) 4560
(8,16) 5440
(16,0) 4800
Q5. Maximize z = 3x +4y, if possible,
Subject to the constraints: x – y ≤ − 1, −x + y≤ 𝟎. x , y ≥ 𝟎 (2022)
SOLUTION
The feasible region determined by the system of constraints, 𝑥 − 𝑦 ≤ −1, −𝑥 + 𝑦 ≤ 0, 𝑥, 𝑦 ≥ 0, is as
follows.

Since there is no feasible region .Therefore, there is no maxima value of Z.

Case Study
𝟏
Q6. A factory manufactures tennis rackets and cricket bats. A tennis racket takes 1 𝟐 hours of machine
time and 3 hours of craftsmanship in its making; while a cricket bat takes 3 hours of machine time and
1 hour of craftsmanship. In a day, the factory has availability of not more than 42 hours of machine
time and 24 hours of craftsmanship. Profit on a racket and on a bat are Rs 20 and Rs 10 respectively.
(2023)
Based on the above information, answer the following questions :
(i) If x and y are the numbers of Racket and bats manufactured by the factory, then write the
expression of total profit.
(ii) Write the constraint that relates the number of craftsmanship hours.
(iii) (a) Determine the maximum profit (in Rs) earned by the factory.
OR
(iii) (b) How many bats and rackets respectively, are to be manufactured to earn maximum profit ?
Solution : (I) Here, profit on tennis racket is 20 Rs and on cricket bat is 10 Rs
So, objective function is Z=20X+10Y
(ii) Since, tennis bat requires 1.5 hours and cricket bat requires 3 hours of machine time. Also, there is
maximum 42 hours of machine time available.∴1.5X+3Y≤42 ⇒X+2Y≤28 ...(1)
(iii)
 Corner points Z - 20x + 10y
(0,14) 140
(4,12) 200- Max
(8,0) 160
Maximum profit of factory will be Rs 200
Or
(b) 4 tennis rackets and 12 cricket bats must be made so that factory will work at full capacity.
Q7. The maximum value of the function z = 7x + 5y , subject to constraints are x ≤ 3, y ≤ 2, x ≥ 0 , y ≥ 0
is
(a). 21 (b). 10 (c). 31 (d). 37 (2023- comptt)
Solution : on soving x ≤ 3, y ≤ 2 we get (3,2) as corner point
(3,0) , (0,2) and (0,0) other corner points
Corner points z = 7x + 5y
(3,2) 31- Max
(3,0) 21
(0,2) 10
(0,0) 0
Hence correct option is (c)
Q8. A small firm manufactures gold rings and chains. The combined number of rings and chains
manufactured per day is atmost 24. It takes one hour to make a ring and half an hour for a chain. The
maximum number of hours available per day is 16 If the profit on a ring is Rs 300 and on a chain is Rs
190, Formulate as an LPP. (2023- comptt)
Solution : let no of gold ring and chain be x&y respectively
1
x + y ≤ 24 -----------(i) x + 2 𝑦 ≤ 16-----(ii) X,y ≥ 0--------(iii)
Z = 300x + 190y
Q9. A library has to accommodate two different types of books on a shelf. The books are 6 cm and 4
cm thick and weight 1 kg and 1.5 kg each, respectively. The shelf is 96 cm long and atmost can support
a weight of 21 kg. How should the shelf be filled with the books of two types in order to include the
greatest number of books ? Make it as an LPP and solve it graphically. (2023- comptt)
Solution : Let two type of books be x and y,
Subject to constraints 6x + 4y ≤ 96 ⇒ 3x+2y ≤ 48 , x + 1.5y ≤ 21 ⇒ 2x + 3y ≤ 42 and x,y ≥ 0
On solving equation (i) and (ii) we get , x=12 and y=6
Thus, the point of intersection is B(12,6)
And from the graph OABCD is the feasible region which is bounded. The corner points
are O(0,0),A(0,14),B(12,16),C(16,0).
Corner points Value of Z=x+y
O(0,0) Z=0+0=0
A(0,14) Z=0+14=14
B(12,16) Z=12+6=18(maximum)
C(16,0) Z=16+0=16

From the table the maximum value of Z is 18 at B(12,6).

Hence, The maximum number of books of I type is 12 and books of II type is 6.
Q10. The graph of the inequation 2x + 3y > 6 is the : (2024)
(a) entire XOY-plane
(b) half-plane that contains the origin
(c) half-plane that neither contains the origin nor the points on the line 2x + 3y = 6
(d) whole XOY-plane excluding the points on the line 2x + 3y = 6
Solution : (c)

half-plane that neither contains the origin nor the points on the line 𝟐𝐱+𝟑𝐲=𝟔
Q11. In an LPP, if the objective function Z = ax + by has same maximum value on two corner points of
the feasible region, then the number of points at which maximum value of Z occurs is : (2024)
(a) 0 (b) 2 (c) finite (d) infinite
Solution : (d) Infinite .
Q12. Find the solution to the following linear programming problem (if it exists) graphically :
Maximize Z = x + y subject to the constraints x – y ≤ – 1 , – x + y ≤ 0 , x, y ≥ 0. (2024)
Solution :
Since feasible region is empty, there is no solution to the problem.
Q13. In number theory, it is often important to find factors of an integer N. The number N has two
trivial factors, namely 1 and N. Any other factor, if exists, is called non-trivial factor of N. Naresh has
plotted a graph of some constraints (linear inequations) with points A (0, 50), B (20, 40), C (50, 100), D
(0, 200) and E (100, 0). This graph is constructed using three non-trivial constraints and two trivial

constraints. One of the non-trivial constraints is x+2y≥100.

Based on the above information, answer the following questions : (2024)
(i) What are the two trivial constraints ?
(ii) (a) If R1 is the feasible region, then what are the other two non-trivial constraints ?
OR
(b) If R2 is the feasible region, then what are the other two non-trivial constraints ?
(iii) If R1 is the feasible region, then find the maximum value of the objective function z = 5x + 2y.
𝑦 −𝑦
Solution : Equation of line : 𝑦 − 𝑦1 = 2 1 (𝑥 − 𝑥1 )
𝑥2 −𝑥1
100−40
Equation of BC : 𝑦 − 40 = 50−20 (𝑥 − 20) ⇒ 𝑦 − 40 = 2(𝑥 − 20) ⇒ 2𝑥 − 𝑦 = 0
0−50 1
Equation of AE : 𝑦 − 50 = 100−0 (𝑥 − 0) ⇒ 𝑦 − 50 = − 2 (𝑥) ⇒ 𝑥 + 2𝑦 − 100 = 0
0−200
Equation of DE : 𝑦 − 200 = (𝑥 − 0) ⇒ 𝑦 − 200 = −2(𝑥) ⇒ 2𝑥 + 𝑦 − 200 = 0
100−0
(I) x ≥ 0 , y ≥ 0
(ii) (a) 2x – y ≤ 0 and 2x + y ≤ 200
OR
(b) 2x + y ≤ 200 and 2x – y ≥ 0
(iii) Corner points of R1 are A(0,50),B(20,40),C(50,100) and 𝐷(0,200)
Z𝐀=𝟏𝟎𝟎; 𝐙𝐁=𝟏𝟖𝟎;𝐙𝐂=𝟒𝟓𝟎; 𝐙𝐃=𝟒𝟎𝟎 So, 𝑍 is maximum at 𝐶 and maximum value of Z=450
Q14. The number of solutions of an LPP to minimize Z = 3x + 2y under the constraints x + y ≥ 8 ,
3x + 5y ≤ 15 and x , y ≥ 0 is : (2024-comptt)
(a) 2 (b) 5 (c) infinitely may (d) zero
Solution : (d)
 There is no common region . so , there is no solution

Q15. Two tailors, A and B, earn Rs 1500 and Rs 2000 per day respectively. A can stitch 6 shirts and 4
pants while B can stitch 10 shirts and 4 pants per day. Form a linear Programming problem to
minimize the labour cost to produce at least 60 shirts and 32 pants. (2024-comptt)
Solution : Let tailor A & B work for x days & y days.
:at least 60 shirt stitched by both tailor : 6x+ 10y ≥ 60 = 3x+5y ≥ 30
At least 32 pairs of trouser stitched by both tailor 4x+4y ≥ 32 = x + y ≥ 8
:no of days can’t be negative :x,y ≥ 0
Profit earned by A & B is ₹ 1500 and ₹ 2000 :Z = 1500x + 2000y
Q16. A dictation has to develop a special diet using two foods P &Q. Each packet containing (30 gram)
of food P contains 12 units of Calcium, 4 units of iron, 6 unit of cholesterol and 6 units of vitamin A.
Each packet of the same quantity of food Q contains 3 unit of calcium, 20 units of iron, 4 units of
cholesterol and 3 units of vitamin .The diet require at least 240 units of Calcium, at least 460 units of
iron and at most 300 units of cholesterol. How many packets of each food should be used to minimize
the amount of vitamin A? What is the minimum amount of vitamin A? Formulate the above problem
as an LPP and solve it graphically? (2024-comptt)
Solution : Let the dietician uses x packets of food P and y packets of Q.
we construct the following table:
Food Amount of Amount of iron Amount of Amount of
Calcium cholesterol Vitamin A
P 12x 4x 6x 6x
Q 3y 20y 4y 3y
Requires ≥ 240 ≥ 460 ≤ 300
So, maximize Z = 6x + 3y .....(i)
Subject to constraints 12x + 3y ≥ 240 ⇔ 4x + y ≥ 80 ......(i) 4x + 20y ≥ 460 ⇔ x + 5y ≥ 115 ...(ii)
6x + 4y ≤ 300 ⇔ 3x + 2y ≤ 150 ......(iii) x ≥ 0, y ≥ 0 ......(iv)
So, the half plane is towards the origin.
Since, x, y ≥ 0 . So, the feasible region lies in the first quadrant.
On solving equations 4x + y = 80 and x + 5y = 115, we get A(15, 20).
Similarly, solving the equations, 3x + 2y = 150 and x + 5y = 115, we get B(40, 15).
∴ Feasible region is ABCA.
The corner points of the feasible region are A(15, 20), B(40, 15) and C(2, 72).
Corner point Z = 6x + 3y
(15,20) 150 -- Minimum
(40,15) 285 -- Maximum

(2,72) 228

Thus, the Minimum value of Z is 150 at B(15,20).

Therefore, to Minimize the amount of vitamin A in the diet, 15 packets of food P and 20 packets of food
Q should be used. The Minimum amount of vitamin A in the diet is 150 units.

Q17. In a LPP, the maximum value of z = 3x + 4y subject to the constraints x + y ≤ 40 , x + 2y ≤ 60 , x ,y ≥

0 is (2025)
(a) 120 (b) 140 (c) 150 (d) 130
Solution :
 Corner points Z = 3x + 4y
(0,0) 0
(0,30) 120
(20,20) 140----maximum
(40,0) 120
Q18. There are 2 types of Fertilizers F1 and F2. F1 consists of 10% nitrogen and 6% phosphoric acid.
F2 consists of 5% nitrogen and 10% phosphoric acid . After testing the soil condition , a farmer finds
that he needs at least 14 kg of nitrogen and 14 kg of phosphoric acid for his crop . F1 costs ₹6 per kg
and F2 costs ₹5 per kg , how much of each type of fertilizer should be used so that the cost is
minimum. Formulates linear programming problem. (2025)
Solution : Let x kg of nitrogen and y kg of phosphoric acid is used for minimum cost
∴ the objective function is Minimize
Z = 6x + 5y
Subject to the constraints 10% x + 5% y ≥ 14
⇒ 2x + y ≥ 280
And 6% x + 10% y ≥ 14 ⇒ 3x + 5y ≥ 700
also x , y ≥ 0
Q19. solve the following linear programming problem graphically: (2025)
Maximise Z = 50x + 30y
Subject to 2x + y ≤ 18 , 3x + 2y ≤ 34 , x , y ≥ 0
Solution :

Corner points Z = 50x + 30y

(0,0) 0

(0,17) 510

(2,14) 520

(9,0) 450

Q20. There are two factories located one at place P and the other at place Q. From these locations, a
certain commodity is to be delivered to each of the three depots situated at A, B and C. The weekly
requirements of the depots are respectively 4, 4 and 6 units of the commodity while the production
capacity of the factories at P and Q are respectively 9 and 5 units. The cost of transportation per unit
is given below:

Based on the of information answer the following From/To Cost (in ₹)

questions : A B C

let X units and y units of the commodity be P 160 100 150

transported from factory P to the decode at A and B Q 100 120 100

respectively then (2025)

(i) find in term of X&Y how many units of commodity be transported from factory P to depot C

(ii) find how many units of commodity we transported from factory Q to A ,B and C respectively

(iii) using (i) and (ii) find the total transportation cost Z

OR

using (i) and (ii) find the constraints inequalities for minimum cost Z

Solution : (i) P to C = 9-(x+y)

(ii) Q to A = 4 – x , Q to B = 4 – y
Q to C = 6 – (9 – x- y) = x + y – 3
(iii) z = 160x + 100y + 150(9 − x − y) + 100(4 − x) + (4 − y)120 + 100(x + y − 3) = 10x − 70y + 1930
OR
x ≥ 0 … … (i) y ≥ 0 … … … (ii)
9−x − y ≥ 0 ⇒ x + y ≤ 9 … … (iii)
4 − x ≥ 0 = x ≤ 4 … (iv)
4−y ≥ 0 = y ≤ 4 … (v)
x + y − 3 ≥ 0 ⇒ x + y ≥ 3 … (vi)
Q21. The graph of the inequation 3x + 2y > 6 is the : (2025-comptt )
(a) entire XOY-plane
(b) whole XOY-plane excluding the points on the line 3x + 2y = 6
(c) half-plane that contains the origin
(d) half-plane that neither contains the origin nor the points on the line 3x + 2y = 6 Solution :
half-plane that neither contains the origin nor the points on the line 3𝐱+2𝐲=𝟔
Q22. Minimize Z = 5x + 10y , subject to the constraints : x+2y ≤ 120 , x + 2y ≥ 60 ,
x – 2y ≥ 0 , x,y ≥ 0 (2025-comptt )
Solution : Draw the lines of x + 2y = 120 , x + y = 60 and x – 2y = 0 ,

Shade the region satisfied by given inequalities .

Corner points Z = 5x + 10y
(60,0) 300
(120,0) 600
(60,30) 600
(40,20) 400
Minimum value is 300 at (60,0)
Maximum value is 600 on all points on the line segment joining the points (120,0) and (60,30)
Q23. The feasible region for an LPP is shown in the graph given below :

Based on the above information , answer the following questions :

(i) Determine the equation of CD
(ii) Determine the equation of EF
(iii) (a) Determine all the constraints for the LPP
OR
(iii) (b) Find the maximum value of the objective function Z = 600x + 400y
(2025-comptt)
Solution : From the given figure, OD = 12 and OC = 6.
The equation of the line CD is
x y
+ = 1 (intercept form)
12 6
i.e. x + 2y = 12.
(b) From the given figure, OF = 5 and OE = 4.
The equation of the line EF is
x y
+ = 1 i.e. 4x + 5y = 20.
5 4
(c) From the given figure, OB = 6 and OA = 12.
The equation of the line AB is
x y
+ = 1 i.e. 2x + y = 12.
6 12
As (0,0) lies in the region x + 2y ≤ 12 and (0, 0) also lies in the region 2x + y ≤ 12 but (0.0) doesn’t lie in the
region 4x +5y ≥ 0 , therefore, the constraints for the L.P.P are
x +2 y ≤ 12, 2x + y ≤ 12, 4x +5y ≥ 0 , x ≥ 0, y ≥ 0
OR
The corner points of the feasible region are F(5,0), B(6,0), E(0,4) X (4,4) and C(0, 6). Objective function is Z =
600x + 400y.
The values of Z at the corner points are
at F(5, 0), Z= 600 x 5 + 400 x 0 = 3000,
at B(6, 0), Z = 600 x 6 + 400 x 0 = 3600,
at E(0, 4), Z = 600 x 0 + 400 x 4 = 1600,
at X(4,4) , Z = 600 x 4 + 400 x 4 = 4000
at C(0, 6), Z= 600 x 0 + 400 x 6 = 2400.
The maximum value of the objective function Z = 600x + 400y is 4000 and it is attained at the point X.