Chapter 12

Linear Programming
PYQ

1. Solve Linear Programming Problem

(LPP) graphically

Maximize 𝑍 = 17.5𝑥 + 7𝑦
Subject to constraints
3𝑥 + 𝑦 ≤ 12
𝑥 + 3𝑦 ≤ 12
𝑥 ≥0
𝑦 ≥0

[6][Model 2023]

Ans.
Maximum of Z is 73.5 at (3,3).

2. Consider the LPP

Maximize 𝑧 = 3𝑥 + 2𝑦
Subject to the constraints

𝑥 + 2𝑦 ≤ 10,3𝑥 + 𝑦 ≤ 15; 𝑥, 𝑦 ≥ 0
(a) Draw its feasible region
(b) Find the corner points of the feasible
region
(c) Find the maximum value of 𝑍.

[6][Model 2022]

Ans.

(a)

+917510998855
+919207998855
(b) The corner points ◯(0,0), 𝐴(5,0),
𝐵(4,3), 𝐶(0,5)

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

𝑧 = 18.

3. Solve the following problem

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

[6][March 2021]

Ans.
∴ 𝑍 has maximum when 𝑥 = 4,
𝑥 + 2𝑦 = 10 𝑦 = 3 Maximum value = 18
3𝑥 + 𝑦 = 15

4. Solve the L.P.P given below

graphically:

Max: 𝑍 = 3𝑥 + 2𝑦 subject to the

constraints:

𝑥 + 2𝑦 ≤ 10 3𝑥 + 𝑦 ≤ 15
𝑥 ≥ 0, 𝑦 ≥ 0

[6][March 2021]

+917510998855
+919207998855
 Ans. (ii). Find the co-ordinates of the
corner points of the feasible
region.
(iii). Solve the LPP.

[6][say 2020]
Ans.

(i).

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

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

A(5,0) 15 (iii). Given; 𝑍 = 200𝑥 + 500𝑦

B(4,3) 18

C(0,5) 10

Maximum 𝑍 = 18 at (4,3)
𝑥 = 4 ,𝑦 = 3

Maximum 𝑍 = 18 at (4,3)𝑥 = 4,
𝑦=3
Since minimum value of 𝑍
5. Consider the LPP occurs at 𝐴, the solution is
Minimize; 𝑍 = 200𝑥 + 500𝑦
𝑥 + 2𝑦 ≥ 10,3𝑥 + 4𝑦 ≤ 24, 𝑥 ≥ 0, 𝑦 𝑍 = 20𝛼(4) + 500(3) = 2300
≥0
(i). Draw the feasible region.

+917510998855
+919207998855
6. 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; 7. 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 𝑧.

[1][Say 2017] (i). Draw its feasible region. [3]

Ans. (ii). Find the corner points of the
feasible region. [2]
(i). (iii). Find the corner at which 𝑍
attains its maximum.

[1][March 2017]
Ans.

(i).

(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 (ii). In the figure the shaded region
𝐴𝐵𝐶 is the fesible region. Here
A 𝑍 = 50(4) + 40(3) = 320 the region is bounded. The
corner points are
B 𝑍 = 50(0) + 40(6) = 240 𝐴(1,1), 𝐵(5,3), 𝐶(0,3).

C 𝑍 = 50(0) + 40(5) = 200 (iii). Given; 𝑍 = 𝑥 + 𝑦

+917510998855
+919207998855
 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.

8. Consider the linear programming

problem: (b) Solving the equations we get the
Maximum 𝑧 = 4𝑥 + 𝑦 points as
Subject to constraints:
𝑂(0,0) ⋅ 𝐴(30,0); 𝐵(20,30); 𝐶(0,50)
𝑥 + 𝑦 ≤ 50; 3𝑥 + 𝑦 ≤ 90; 𝑥, 𝑦 ≥ 0
(c)
(a) Draw the feasible region [3]
(b) Find the corner points of the Vertices z
feasible region [2]
(c) Find the corner at which ' 𝑧 ' attains
𝑂(0,0) 0
its maximum value.

[1][say 2015] 𝐴(30,0) 120 maximum

Ans. 𝐵(20,30) 110

(a) 𝑥 + 𝑦 = 50
𝐶(0,50) 50

3𝑥 + 𝑦 = 90

𝑍 attains maximum at 𝐴(30,0)

9. Consider the linear inequalities

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

+917510998855
+919207998855
(a) Mark the feasible region. [2] Maximum at x = 1.5, y = 1
Maximum value is 𝑍 = 11
(b) Maximise the function 𝑧 = 4𝑥 +
5𝑦 subject to the given constraints. 10. Consider the linear programming
problem:
[2][march 2015] Minimise 𝑧 = −3𝑥 + 4𝑦
Subject to 𝑥 + 2𝑦 ≤ 8; 3𝑥 + 2𝑦 ≤
Ans. 12; 𝑥, 𝑦 ≥ 0

(a) (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

𝑥 0 8
(b)
𝑦 4 0
𝑋 0 3
𝑥 0 4
𝑌 2 0
𝑦 6 0

(b)
2𝑥 + 𝑦 = 4

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

𝑂(0,0) 𝑍 = 0+0 =0
𝐴(0,10), 𝐵(5,5), 𝐶(15,15), 𝐷(0,20)
𝑍 = −12 + 0
𝐴(4,0) (iii). Given; 𝑍 = 3𝑥 + 9𝑦
= −12

𝐵(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)
C
11. Consider the linear programming = 190
problem: Minimize 𝑍 = 3𝑥 + 9𝑦
Subject to the constraints: 𝑥 + 3𝑦 ≤ D 𝑍 = 3(0) + 9(20) = 180
60𝑥 + 𝑦 ≥ 10, 𝑥 ≤ 𝑦, 𝑥 ≥ 0, 𝑦 ≥ 0

(i). Draw its feasible region. [3] Form the table, minimum value of 𝑍 is
60 at 𝐵(5,5)
(ii). Find the vertices of the feasible
region [2] 12. consider the LPP
(iii). Find the minimum value of 𝑍 Maximize; 𝑍 = 5𝑥 + 3𝑦
subject to the given constraints. Subject to; 3𝑥 + 5𝑦 ≤ 15,5𝑥 + 2𝑦 ≤
10, 𝑥, 𝑦 ≥ 0
[1] [march 2014]
Ans. (i). Draw the feasible region. [3]
(ii). Find the corner points of the
(i). feasible region. [2]
(iii). Find the corner at which 𝑍 attains
its maximum. [1]

[march 2013]
Ans.

In the figure the shaded region OABC is

the feasible region. Here the region is

+917510998855
+919207998855
 bounded. 13. The graph of a linear programming
The corner points are problem is given below. The shaded
region is the feasible region. The
20 45 objective function is
O(0,0), 𝐴(2,0), 𝐵 ( , ) , 𝐶(0,3)
19 19 Maximise; 𝑍 = 𝑝𝑥 + 𝑞𝑦
(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. 𝑍.

(ii). Given; 𝑍 = 5𝑥 + 3𝑦 [1][March 2011]

Corner
Value of 𝑍
points

O 𝑍=0

A 𝑍 = 5(2) + 3(0) = 10

20 45 235
B 𝑍 = 5( ) +3( ) =
19 19 19

C 𝑍 = 5(0) + 3(3) = 9

(iii). Since maximum value of 𝑍 occurs Ans.

at 𝐵, the soluion is
(i). From the figure the feasible
235 20 45 region is OABC. Then the corner
𝑍= ,( , ) points are:
19 19 19
(ii). A is (5,0), B is (3,4), C is (0,5)
and O(0,0)2𝑥 + 𝑦 ≤ 10, 𝑥 +
3𝑦 ≤ 15, 𝑥 ≥ 0, 𝑦 ≥ 0

+917510998855
+919207998855
 (iii). Given; 𝑍 = 𝑝𝑥 + 𝑞𝑦

Corner
Value of 𝐙
points

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

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

𝑍 = 𝑝(3) + 𝑞(4)
B
= 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𝑥 +
𝑦
(v). We have; 𝑍 = 𝑝𝑥 + 𝑞𝑦 at 𝐵𝑍
has maximum ⇒ 𝑍 = 2(3) +
4 = 10

+917510998855
+919207998855
+917510998855
+919207998855