Linear Programming – Most Hot Burning Questions – 1st June 2026 Exam

Linear Programming (LP) – Page 267

MOST HOT BURNING QUESTIONS FOR 1st JUNE 2026 EXAM
Exercise 9.1 (Pg. 274) · Exercise 9.2 (Pg. 284)

LP METHOD – 5 Steps (Memorize This!)

Step 1: Write all constraints and non-negativity conditions (x ≥ 0, y ≥ 0)
Step 2: Draw each constraint line on the graph. To draw a line ax + by = c: put x = 0 to
get one point, put y = 0 to get another point. Join them.
Step 3: Find the feasible region (the area satisfying ALL constraints at the same time)
Step 4: Find all corner points (vertices) of the feasible region. Solve pairs of lines
simultaneously to get corner points.
Step 5: Substitute each corner point into the objective function Z. The largest value
= Maximum, smallest value = Minimum.

EXERCISE 9.1 — Graphical Method for LP (Page 274)

⋆⋆⋆ SUPER HOT — Annual 2023 (P.E), Annual 2023 (Model), Supplementary 2024
⋆⋆⋆
Q1. Solve the following Linear Programming problem by graphical method when x ≥
0, y ≥ 0.
Maximize the objective function: Z = f (x, y) = 10x + 11y
Subject to the constraints: 2x + 3y ≤ 8 6x + 3y ≤ 10
Solution Steps:
Corner points of feasible region:
O(0,
 0):Z = 0
5 50
A ,0 : Z= ≈ 16.67
 3  3
1 5 1 7
B , : solve 2x + 3y = 8 and 6x + 3y = 10 simultaneously ⇒ x = , y =
 6 2  2 3
8 88
C 0, : Z= ≈ 29.3
3 3
 
88 8
Ref: Q 3, Page 274 Ans: Zmax = ≈ 29.3 at point C 0,
3 3

EXERCISE 9.2 — More LP Problems (Page 284)

(Section C Questions – 8 marks each)

⋆⋆⋆ SUPER HOT — Annual 2024 (P.E), Annual 2024 (S.G), Model Paper 2026 ⋆⋆⋆
Q2. Solve the Linear Programming problem by graphical method when x ≥ 0, y ≥ 0.
Maximize the objective function: Z = f (x, y) = 30x + 36y
Subject to the constraints: 4x + 2y ≤ 12 6x + 5y ≤ 20

–1–
 Linear Programming – Most Hot Burning Questions – 1st June 2026 Exam

Solution Steps:
Find corner points:
From 4x + 2y = 12: put x = 0 ⇒ y = 6; put y = 0 ⇒ x = 3
10
From 6x + 5y = 20: put x = 0 ⇒ y = 4; put y = 0 ⇒ x =
3
Intersection of both lines: solve simultaneously
4x + 2y = 12 ⇒ 2x + y = 6 ⇒ y = 6 − 2x
5
Substitute: 6x + 5(6 − 2x) = 20 ⇒ 6x + 30 − 10x = 20 ⇒ −4x = −10 ⇒ x =
  2
5
y =6−2 =1
2
Corner Points and Z values:

Corner Point Z = 30x + 36y Value

O(0, 0) 30(0) + 36(0) 0
A(3, 0) 30(3) + 36(0) 90
   
5 5
B , 1 30 + 36(1) 111
2 2
C(0, 4) 30(0) + 36(4) 144

Ref: Q 5, Page 284 Ans: Zmax = 144 at point C(0, 4)

⋆⋆⋆ Annual 2026 Exam (P.E) — May 18, 2026 — ACTUAL EXAM ⋆⋆⋆
Q3. Find the optimal solution of the Linear Programming problem when x ≥ 0, y ≥ 0.
Maximize the objective function: z(x, y) = 6x − 8y
Subject to the constraints: 30x + 20y ≤ 300 5x + 10y ≤ 110
Solution Steps:
From 30x + 20y = 300: simplify to 3x + 2y = 30; put x = 0 ⇒ y = 15; y = 0 ⇒ x = 10
From 5x + 10y = 110: simplify to x + 2y = 22; put x = 0 ⇒ y = 11; y = 0 ⇒ x = 22
Intersection: 3x + 2y = 30 and x + 2y = 22
Subtract: 2x = 8 ⇒ x = 4, y = 9
Corner Points:

Corner Point Z = 6x − 8y Value

O(0, 0) 0 0
A(10, 0) 6(10) − 8(0) 60
B(4, 9) 6(4) − 8(9) −48
C(0, 11) 6(0) − 8(11) −88

Ref: Q 6, Page 284 Ans: Zmax = 60 at point A(10, 0)

⋆⋆⋆ Annual 2024 (Revised Model) ⋆⋆

Q4. Find the feasible region and its corner points for the following Linear Programming
problem.
Minimize: Z = x − 9y

–2–
 Linear Programming – Most Hot Burning Questions – 1st June 2026 Exam

Subject to the constraints: 2x + 3y ≤ 48 x ≤ 15 y ≤ 10 x ≥ 0, y ≥ 0

Corner Points: O(0, 0), A(15, 0), B(15, 6), C(9, 10), D(0, 10)

Corner Point Z = x − 9y Value

O(0, 0) 0−0 0
A(15, 0) 15 − 0 15
B(15, 6) 15 − 54 −39
C(9, 10) 9 − 90 −81
D(0, 10) 0 − 90 −90

Ref: Q 4, Page 284 Ans: Zmin = −90 at point D(0, 10)

⋆ MOST HOT — MUST PRACTICE FOR 1st JUNE 2026:

1. Maximize Z = 30x + 36y, subject to 4x + 2y ≤ 12, 6x + 5y ≤ 20 [3 papers – Q2 –

SUPER HOT]
⇒ Answer: Zmax = 144 at (0, 4)

2. Maximize Z = 10x + 11y, subject to 2x + 3y ≤ 8, 6x + 3y ≤ 10 [3 papers – Q1]

 
88 8
⇒ Answer: Zmax = at 0,
3 3

3. Maximize z = 6x − 8y, subject to 30x + 20y ≤ 300, 5x + 10y ≤ 110 [2026 Actual
Exam – Q3]
⇒ Answer: Zmax = 60 at (10, 0)

4. Minimize Z = x − 9y, subject to 2x + 3y ≤ 48, x ≤ 15, y ≤ 10 [2024 Revised – Q4]

⇒ Answer: Zmin = −90 at (0, 10)

Remember: Always make a corner point table in your answer.

You get full marks only when you show: graph + corner points + table + conclusion.

–3–