Chapter 12

Linear Programming
PYQ

1. Solve the following LPP

graphically.
Maximise : Z = 4x + y
Subject to the constraints :
𝑥 + 𝑦 ≤ 50
3𝑥 + 𝑦 ≤ 90
𝑥 ≥ 0, 𝑦 ≥ 0 (6)
[FEB 2025]
Ans:

Point 𝑍 = 3𝑥 + 4𝑦

𝐴(0,5) 𝑍 = 3(5) + 4(0) = 15

𝐵(4,3) 𝑍 = 3(4) + 4(3) = 24

Hence, maximum value of Z is 120 at ← Max

the point (30,0) 𝐶(5,0) 𝑍 = 3(5) + 4(0) = 15

2. Using graphical method, solve the 𝐷(0,0) 𝑍=0

Linear Programming
Maximize, 𝑍 = 3𝑥 + 4𝑦 ∴ 𝑀𝑎𝑥𝑖𝑚𝑢𝑚 𝑜𝑓 𝑍 = 24 𝑎𝑡 𝐵(4,3)
subject to the constraints
𝑥 + 2𝑦 ≤ 10 3. Solve the following linear
3𝑥 + 𝑦 ≤ 15; 𝑥 ≥ 0, 𝑦 ≥ 0 programming problem graphically:
[6][MARCH 2025] Maximise 𝑍 = 60𝑥 + 15𝑦
Ans: Subject to the constraints
𝑥 + 𝑦 ≤ 50
𝑍 = 3𝑥 + 4y
3𝑥 + 𝑦 ≤ 90
𝑥 ≥ 0, 𝑦 ≥ 0
(6) [March 2024]
Ans.
x + y = 50
x 0 50
y 50 0

+919207998855
 3𝑥 + 𝑦 = 90 x 0 20
x 0 30
y 15 0
y 90 0
𝑥 + 𝑦 = 10
x 0 10
y 10 0

𝑥 − 3𝑦 = −6
x 0 -6
y 2 0

Corner points Z = 3x + 2y
O (0, 0) 0
A (30, 0) 1800
B (20, 30) 1650
ABCD is the feasible region.
C (0, 50) 750
At A (0, 15) , z = 3x + 7y = 105
At B (0, 10) , z = 3x + 7y = 70
Maximum value of Z is 1800 at (30,0) At C (6, 4) , z = 3x + 7y = 46
At D (12, 6) , z = 3x + 7y = 78
4. Solve the linear programming problem
graphically : Therefor max Z = 105 at A (0, 15)
Maximise : 𝑍 = 3𝑥 + 7𝑦
Subject to the constraints : 5. Solve the LPP graphically :
3𝑥 + 4𝑦 ≤ 60 Maximise 𝑍 = 3𝑥 + 2𝑦
𝑥 + 𝑦 ≥ 10 subject to :
𝑥 − 3𝑦 ≤ −6 𝑥 + 2𝑦 ≤ 10
𝑥≥0 3𝑥 + 𝑦 ≤ 15
(6) [Model 2024] 𝑥, 𝑦 ≥ 0
Ans. (6) [Imp 2024]
Ans.
3𝑥 + 4𝑦 = 60 The lines are x + 2y = 10

+919207998855
 x 0 10
y 5 0

y + 3x = 15
x 0 5
y 15 0

Corner points Z = 3x + 2y
(0, 0) 0
(5, 0) 15
(0, 5) 10
(4, 3) 18⟶Max

Z is maximum at (4,3).

6. Solve Linear Programming Problem

(LPP) graphically
Maximum of Z is 73.5 at (3,3).
Maximize 𝑍 = 17.5𝑥 + 7𝑦
Subject to constraints
7. Consider the LPP
3𝑥 + 𝑦 ≤ 12 Maximize 𝑧 = 3𝑥 + 2𝑦
𝑥 + 3𝑦 ≤ 12 Subject to the constraints
𝑥 ≥0
𝑦 ≥0 𝑥 + 2𝑦 ≤ 10,3𝑥 + 𝑦 ≤ 15; 𝑥, 𝑦 ≥ 0
(a) Draw its feasible region
[6][Model 2023]
(b) Find the corner points of the feasible
Ans. region
(c) Find the maximum value of 𝑍.

+919207998855
 [6][Model 2022]

Ans.

(a)

(b) The corner points ◯(0,0), 𝐴(5,0),

𝐵(4,3), 𝐶(0,5)

(c) 𝑍 is maximum at 𝐵(4,3),

𝑧 = 18.

8. Solve the following problem

graphically Maximise: 𝑧 = 3𝑥 + 2𝑦
Subject to: 𝑥 + 2𝑦 ≤ 10
3𝑥 + 𝑦 ≤ 15𝑥, 𝑦 ≥ 0

[6][March 2021]
∴ 𝑍 has maximum when 𝑥 = 4,
Ans. 𝑦 = 3 Maximum value = 18

𝑥 + 2𝑦 = 10
3𝑥 + 𝑦 = 15

+919207998855
9. Solve the L.P.P given below
graphically:
Maximum 𝑍 = 18 at (4,3)
Max: 𝑍 = 3𝑥 + 2𝑦 subject to the 𝑥 = 4 ,𝑦 = 3
constraints:
Maximum 𝑍 = 18 at (4,3)𝑥 = 4,
𝑦=3
𝑥 + 2𝑦 ≤ 10 3𝑥 + 𝑦 ≤ 15
𝑥 ≥ 0, 𝑦 ≥ 0
10. Consider the LPP
[6][March 2021] Minimize; 𝑍 = 200𝑥 + 500𝑦
𝑥 + 2𝑦 ≥ 10,3𝑥 + 4𝑦 ≤ 24, 𝑥 ≥ 0, 𝑦
≥0
(i). Draw the feasible region.
(ii). Find the co-ordinates of the
corner points of the feasible
Ans. region.
(iii). Solve the LPP.

[6][say 2020]
Ans.

(i).

Solving 𝑥 + 2𝑦 = 10; 3𝑥 + 𝑦 = 15
𝑥 + 2𝑦 = 10; 3𝑥 + 𝑦 = 15
(ii). In the figure the shaded
we get 𝐵(4,3)
region 𝐴𝐵𝐶 is the fesible
region. Here the region is
bounded. The comer points
Vertices 𝑍 = 3𝑥 + 2𝑦 are 𝐴(4,3), 𝐵(0,6), 𝐶(0,5)

O(0,0) 0 (iii). Given; 𝑍 = 200𝑥 + 500𝑦

A(5,0) 15

B(4,3) 18

C(0,5) 10

+919207998855
 (ii). In the figure the shaded region
𝐴𝐵𝐶 is the fesible region. Here
the region is bounded. The
comer points are
𝐴(4,3), 𝐵(0,6), 𝐶(0,5)

(iii). Given; 𝑍 = 50𝑥 + 40𝑦

Corner Value of z
points
Since minimum value of 𝑍
occurs at 𝐴, the solution is A 𝑍 = 50(4) + 40(3) = 320

𝑍 = 20𝛼(4) + 500(3) = 2300 B 𝑍 = 50(0) + 40(6) = 240

C 𝑍 = 50(0) + 40(5) = 200

11. Consider the linear programming Since minimum value of 𝑍 occurs at 𝐴,

problem: the soluion is 𝑍 = 50(4) + 40(3) =
Maximum 𝑧 = 50𝑥 + 40𝑦 320.
Subject to constraints:

𝑥 + 2𝑦 ≤ 10; 12. Consider the linear programming

problem; Maximise;
3𝑥 + 4𝑦 ≥ 24; 𝑥, 𝑦 ≥ 0
𝑍 = 𝑥 + 𝑦, 2𝑥 + 𝑦 − 3
(i). Draw the feasible region [3] ≤ 0, 𝑥 − 2𝑦 + 1 ≤ 0, 𝑦
(ii). Find the comer points of the ≤ 3, 𝑥 ≥ 0, 𝑦 ≥ 0
feasible region [2]
(iii). Find the maximum value of 𝑧.
(i). Draw its feasible region. [3]
[1][Say 2017]
(ii). Find the corner points of the
Ans.
feasible region. [2]
(iii). Find the corner at which 𝑍
(i).
attains its maximum.

[1][March 2017]
Ans.

(i).

+919207998855
 [1][say 2015]

Ans.

(a) 𝑥 + 𝑦 = 50

(ii). In the figure the shaded region

3𝑥 + 𝑦 = 90
𝐴𝐵𝐶 is the fesible region. Here
the region is bounded. The
corner points are
𝐴(1,1), 𝐵(5,3), 𝐶(0,3).

(iii). Given; 𝑍 = 𝑥 + 𝑦

Corner Value of Z
points
A 𝑍 = (1) + (1) = 2
B 𝑍 = (5) + (3) = 8
C 𝑍 = (0) + (3) = 3

Since maximum value of 𝑍 occurs at 𝐵

the solution is 𝑍 = (5) +(3) = 8.

13. Consider the linear programming

problem:
Maximum 𝑧 = 4𝑥 + 𝑦 (b) Solving the equations we get the
Subject to constraints: points as

𝑥 + 𝑦 ≤ 50; 3𝑥 + 𝑦 ≤ 90; 𝑥, 𝑦 ≥ 0 (0,0) ⋅ 𝐴(30,0); 𝐵(20,30); 𝐶(0,50)

(a) Draw the feasible region [3] (c)

(b) Find the corner points of the
feasible region [2] Vertices z
(c) Find the corner at which ' 𝑧 ' attains
its maximum value. 𝑂(0,0) 0

+919207998855
 𝐴(30,0) 120 maximum 𝑋 0 3

𝐵(20,30) 110 𝑌 2 0

𝐶(0,50) 50

2𝑥 + 𝑦 = 4

𝑍 attains maximum at 𝐴(30,0)

14. Consider the linear inequalities

2𝑥 + 3𝑦 ≤ 6; 2𝑥 + 𝑦 ≤ 4; 𝑥, 𝑦 ≥ 0

(a) Mark the feasible region. [2]

(b) Maximise the function 𝑧 = 4𝑥 + Maximum at x = 1.5, y = 1

5𝑦 subject to the given constraints. Maximum value is 𝑍 = 11

[2][march 2015] 15. Consider the linear programming

problem:
Ans. Minimise 𝑧 = −3𝑥 + 4𝑦
Subject to 𝑥 + 2𝑦 ≤ 8; 3𝑥 + 2𝑦 ≤
(a) 12; 𝑥, 𝑦 ≥ 0

(a) Mark its feasible region. [3]

(b) Find the corner points of the
feasible region. [2]
(c) Find the corner at which 𝑍 attain
its minimum. [1]

[June 2014]
Ans.

(a) 𝑥 + 2𝑦 = 8 3𝑥 + 12𝑦 = 12
(b)
𝑥 0 8

+919207998855
 𝑦 4 0 Subject to the constraints: 𝑥 + 3𝑦 ≤
60𝑥 + 𝑦 ≥ 10, 𝑥 ≤ 𝑦, 𝑥 ≥ 0, 𝑦 ≥ 0
𝑥 0 4
(i). Draw its feasible region. [3]
𝑦 6 0
(ii). Find the vertices of the feasible
region [2]
(iii). Find the minimum value of 𝑍
(b)
subject to the given constraints.

[1] [march 2014]

Ans.

(i).

The corner points are

(ii). The feasible region is 𝐴𝐵𝐶𝐷.
(c) 0(0,0), A(4,0), B(2,3), 𝐶(0,4) Solving 𝑥 + 𝑦 = 10, 𝑥 = 𝑦 we get
𝐵(5,5)
Solving 𝑥 + 3𝑦 = 60, 𝑥 = 𝑦 we get
Corner point 𝑍 = −3𝑥 + 4𝑦 𝐶(15,15)
Hence the corner points are
𝑂(0,0) 𝑍 =0+0=0
𝐴(0,10), 𝐵(5,5), 𝐶(15,15), 𝐷(0,20)
𝑍 = −12 + 0
𝐴(4,0)
= −12 (iii). Given; 𝑍 = 3𝑥 + 9𝑦

𝐵(2,3) 𝑍 = −6 + 12 = 6 Corner
Value of 𝑍
points
𝐶(0,4) 𝑍 = 0 + 16 = 16
A 𝑍 = 3(0) + 9(10) = 90

𝑍 attains minimum at (4,0). B 𝑍 = 3(5) + 9(5) = 60

𝑍 = 3(15) + 9(15)
16. Consider the linear programming C
= 190
problem: Minimize 𝑍 = 3𝑥 + 9𝑦

+919207998855
 D 𝑍 = 3(0) + 9(20) = 180 (ii). Given; 𝑍 = 5𝑥 + 3𝑦

Corner
Value of 𝑍
Form the table, minimum value of 𝑍 is points
60 at 𝐵(5,5)
O 𝑍=0
17. consider the LPP
Maximize; 𝑍 = 5𝑥 + 3𝑦 A 𝑍 = 5(2) + 3(0) = 10
Subject to; 3𝑥 + 5𝑦 ≤ 15,5𝑥 + 2𝑦 ≤
10, 𝑥, 𝑦 ≥ 0 20 45 235
B 𝑍 = 5( ) + 3( ) =
19 19 19
(i). Draw the feasible region. [3]
(ii). Find the corner points of the C 𝑍 = 5(0) + 3(3) = 9
feasible region. [2]
(iii). Find the corner at which 𝑍 attains
its maximum. [1] (iii). Since maximum value of 𝑍 occurs
at 𝐵, the soluion is

[march 2013] 235 20 45

𝑍= ,( , )
Ans. 19 19 19

In the figure the shaded region OABC is

the feasible region. Here the region is 18. The graph of a linear programming
bounded. problem is given below. The shaded
The corner points are region is the feasible region. The
objective function is
20 45
O(0,0), 𝐴(2,0), 𝐵 ( , ) , 𝐶(0,3) Maximise; 𝑍 = 𝑝𝑥 + 𝑞𝑦
19 19
(i). (i). What are the co-ordinates of the
corners of feasible region?

(ii). Write the constraints. [1]

(iii). If the Max. 𝑍 occurs at 𝐴 and 𝐵,

what is the relation between 𝑝
and 𝑞 ? [2]

(iv). If 𝑞 = 1, write the objective

function. [1]

(v). Find the Max. 𝑍.

[1][March 2011]

+919207998855
 (v). We have; 𝑍 = 𝑝𝑥 + 𝑞𝑦 at 𝐵𝑍
has maximum ⇒ 𝑍 = 2(3) +
4=1

Ans.

(i). From the figure the feasible

region is OABC. Then the corner
points are:
(ii). A is (5,0), B is (3,4), C is (0,5)
and O(0,0)2𝑥 + 𝑦 ≤ 10, 𝑥 +
3𝑦 ≤ 15, 𝑥 ≥ 0, 𝑦 ≥ 0
(iii). Given; 𝑍 = 𝑝𝑥 + 𝑞𝑦

Corner
Value of 𝐙
points

0 𝑍 = 𝑝(0) + 𝑞(0) = 0

A 𝑍 = 𝑝(5) + 𝑞(0) = 5𝑝

B 𝑍 = 𝑝(3) + 𝑞(4) = 3𝑝 + 4𝑞

C 𝑍 = 𝑝(0) + 𝑞(5) = 5𝑞

Since maximum at 𝐴 and 𝐵 we have;

⇒ 3𝑝 + 4𝑞 = 5𝑝 ⇒ 2𝑝 = 4𝑞 ⇒ 𝑝 = 2𝑞

(iv). When 𝑞 = 1, then ⇒ 𝑝 = 2𝑞 ⇒

𝑝=2
Objective function is; 𝑍 = 2𝑥 +
𝑦

+919207998855
+919207998855