CH 12.
LINEAR PROGRAMMING (1 Mark)
2024
1. The maximum value of Z = 4𝑥 + 𝑦 for a LPP
whose feasible region is given below is
(A) 50 (B) 110
(C) 120 (D) 170
2022
1. If the corner points of the feasible region of an LPP are (0, 3), (3, 2) and
(0, 5), then the minimum value of Z = 11𝑥 + 7𝑦 is:
(A) 21 (B) 33 (C) 14 (D) 35
2. The number of solutions of the system of inequations 𝑥 + 2𝑦 ≤ 3 ,
3𝑥 + 4𝑦 ≥ 12, 𝑥 ≥ 0, 𝑦 ≥ 1 is:
(A) 0 (B) 2 (C) finite (D) infinite
3. The maximum value of Z = 3𝑥 + 4𝑦 subject to the constraints 𝑥 ≥ 0,
𝑦 ≥ 0 and 𝑥 + 𝑦 ≤ 1 is:
(A) 7 (B) 4 (C) 3 (D) 10
4. The feasible region of an LPP is given in the following figure:
Then, the constraints of the LPP are 𝑥 ≥ 0,
𝑦 ≥ 0 and
(A) 2𝑥 + 𝑦 ≤ 52 and 𝑥 + 2𝑦 ≤ 76
(B) 2𝑥 + 𝑦 ≤ 104 and 𝑥 + 2𝑦 ≤ 76
(C) 𝑥 + 2𝑦 ≤ 104 and 2𝑥 + 𝑦 ≤ 76
(D) 𝑥 + 2𝑦 ≤ 104 and 2𝑥 + 𝑦 ≤ 38
5. If the minimum value of an objective function Z = 𝑎𝑥 + 𝑏𝑦 occurs at two
points (3, 4) and (4, 3), then:
(A) 𝑎 + 𝑏 = 0 (B) 𝑎 = 𝑏 (C) 3𝑎 = 𝑏 (D) 𝑎 = 3𝑏
6. For the following LPP: Maximise Z = 3𝑥 + 4𝑦, Subject to constraints
𝑥 − 𝑦 ≥ −1, 𝑥 ≤ 3, 𝑥 ≥ 0, 𝑦 ≥ 0, the maximum value is:
(A) 0 (B) 4 (C) 25 (D) 30
2020
1. The feasible region for an LPP is shown
below:
Let z = 3x – 4y be the objective function.
Minimum of z occurs at
(A) (0, 0) (B) (0, 8)
(C) (5, 0) (D) (4, 10)
CH 12. LINEAR PROGRAMMING (Assertion-Reason Based Questions-1 Mark)
In the following questions, a statement of assertion (A) is followed by a
statement of Reason (R). Choose the correct answer out of the following
choices:
(a) Both A and R are true and R is the correct explanation of A.
(b) Both A and R are true but R is not the correct explanation of A.
(c) A is true but R is false.
(d) A is false but R is true.
2024
1. Assertion (A): The corner points of the bounded feasible region of a LPP
are shown below. The maximum
value of Z = 𝑥 + 2𝑦 occurs at
infinite points.
Reason (R): The optimal
solution of a LPP having
bounded feasible region must
occur at corner points.
CH 12. LINEAR PROGRAMMING (3, 4, 5 Marks)
2024
3 Marks
1. Solve the following linear programming problem graphically:
Maximise Z = 2𝑥 + 3𝑦
subject to the constraints: 𝑥 + 𝑦 ≤ 6, 𝑥 ≥ 2, 𝑦 ≤ 3, 𝑥, 𝑦 ≥ 0.
2. Solve the following LPP graphically:
Maximise Z = 𝑥 + 3𝑦, subject to the constraints:
𝑥 + 2𝑦 ≤ 200, 𝑥 + 𝑦 ≤ 150, 𝑦 ≤ 75, 𝑥, 𝑦 ≥ 0.
3. The corner points of the feasible region determined by the system of
linear constraints are as shown in the
following figure:
(i) If Z = 3𝑥 − 4𝑦 be the objective function,
then find the maximum value of Z.
(ii) If Z = 𝑝𝑥 + 𝑞𝑦 where 𝑝, 𝑞 > 0 be the
objective function, find the condition on 𝑝
and 𝑞 so that maximum value of Z occurs
at B (4, 10) and C (6, 8).
2023
5 Marks
1. Solve the following Linear Programming Problem graphically:
Maximize: P = 70𝑥 + 40𝑦
Subject to: 3𝑥 + 2𝑦 ≤ 9, 3𝑥 + 𝑦 ≤ 9, 𝑥 ≥ 0, 𝑦 ≥ 0
2. Minimize: Z = 60𝑥 + 80𝑦
Subject to constraints: 3𝑥 + 4𝑦 ≥ 8, 5𝑥 + 2𝑦 ≥ 11, 𝑥, 𝑦 ≥ 0
2020
4 Marks
1. Minimize: z = 5𝑥 + 7𝑦
Subject to the constraints: 2𝑥 + 𝑦 ≥ 8, 𝑥 + 2𝑦 ≥ 10, 𝑥, 𝑦 ≥ 0
2017
4 Marks
1. Maximize: z = 𝑥 + 2𝑦
Subject to the constraints:
𝑥 + 2𝑦 ≥ 100, 2𝑥 − 𝑦 ≤ 0, 2𝑥 + 𝑦 ≤ 200, 𝑥, 𝑦 ≥ 0
2. Maximize Z = 34𝑥 + 45𝑦
under the following constraints
𝑥 + 𝑦 ≤ 300, 2𝑥 + 3𝑦 ≤ 70, 𝑥 ≥ 0, 𝑦 ≥ 0
3. Maximize Z = 7x + 10y
s.t. 4x + 6y ≤ 240, 6x + 3y ≤ 240, x ≥ 10, x, y ≥ 0
