GRADE XII MATHEMATICS

DISCUSSION CHAPTER 111111111111111

LINEAR PROGRAMMING PROBLEM
DEFINITION OF LINEAR PROGRAMMING
A linear programming problem is a method in which a practical problem is formulated into
mathematical equations which seeks to maximize (or minimize) profit (or cost) or any other
maximization or minimization objective. This method is usually called the method of optimization.
IMPORTANT TERMINOLOGIES IN LINEAR PROGRAMMING
(a) Objective Function: The objective of a linear programming is to maximize or minimize a
quantity. This objective is expressed a linear function in one or more variables depending on
the number of items that helps in achieving the objective and hence this linear function is
optimized using suitable methods of solution.
(b) Constraints (Restrictions): The objective that has to be achieved cannot be done without
suitable inputs or raw materials, which have certain restrictions and conditions which are
represented using linear inequalities in one or more variables.
(c) Graphical Solution: It is one of the methods used to solve a linear programming, in which the
constraints are represented as straight lines on a graph and the region on the graph which
satisfies all the constraints is identified and the corner points of the region is substituted in the
objective function and the optimal corner point is made the solution of the problem.
(d) Feasible region: The region on the graph which satisfies all the constraints is called the
feasible region. All the corner points of the feasible region are found out, and the feasible
region is always represented as a convex polygon.
(e) Optimal solution: The corner points are substituted in the objective function and the values
are computed. The solution with the least value is selected for minimization problems and the
solution with the highest value is selected for maximization problems as the optimal solution.
(g) Bounded and Unbounded Solution: The feasible region that is obtained on the graph may be
a closed polygon then it is called a Bounded Solution. Sometimes the feasible region may not be
closed on all sides, then we call it Unbounded Solution.
(h) Multiple Optimal Solution: There might arise cases where more than one corner point gives
optimal solution, then we call this case as multiple optimal solutions. If two corner points 𝐴
and 𝐵 gives the same optimal solution then we say that there are 𝒊𝒏𝒇𝒊𝒏𝒊𝒕𝒆 𝒔𝒐𝒍𝒖𝒕𝒊𝒐𝒏𝒔 for the
problem on all the points on the line containing the points 𝐴 and 𝐵.
MULTIPLE CHOICE QUESTIONS
1. The solution set of the inequality 3𝑥 + 5𝑦 < 4 is
(a) an open half-plane not containing the origin
(b) an open half-plane containing the origin
(c) the whole 𝑥𝑦-plane not containing the line 3𝑥 + 5𝑦 = 4
(d) a closed half-plane containing the origin.
2. The corner points of the feasible region determined by the system of linear constraints are,
(0, 10), (5, 5), (15, 15), (0, 20). Let 𝑧 = 𝑝𝑥 + 𝑞𝑦, where 𝑝, 𝑞 > 0. Condition on 𝑝 and 𝑞 so that
the maximum of 𝑧 occurs at both the points (15, 15) and (0, 20) is
(a) 𝑝 = 𝑞 (b) 𝑝 = 2𝑞 (c) 𝑞 = 2𝑝 (d) 𝑞 = 3𝑝
3. Corner points of the feasible region determined by the system of linear constraints (0, 3), (1, 1)
and (3, 0). Let 𝑧 = 𝑝𝑥 + 𝑞𝑦, where 𝑝, 𝑞 > 0. Condition on 𝑝 and 𝑞 so that the minimum of 𝑧
occurs at (3, 0) and (1, 1) is
(a) 𝑝 = 2𝑞 (b) 2𝑝 = 𝑞 (c) 𝑝 = 3𝑞 (d) 𝑝 = 𝑞
4. Corner points of the feasible region for an LPP are: (0, 2), (3, 0), (6, 0), (6, 8) and (0,5). Let 𝑧 =
4𝑥 + 6𝑦 the objective function. The minimum value of 𝑧 occurs at
(a) (0, 2) only
(b) (3, 0) only
(c) the mid-point of the line segment joining the points (0, 2) and (3, 0) only
(d) any point on the line segment joining the points (0, 2) and (3, 0)
5. Corner points of the feasible region for an LPP are: (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5). Let 𝑧 =
4𝑥 + 6𝑦 be the objective function. Then, 𝑀𝑎𝑥. 𝑧 − 𝑀𝑖𝑛. 𝑧 =
(a) 60 (b) 48 (c) 42 (d) 18
6. The corner points of the feasible region determined by the system of linear constraints are (0,
0), (0, 40), (20, 40), (60, 20), (60, 0). The objective function is 𝑧 = 4𝑥 + 3𝑦.
Compare the quantity in Column A and Column B
Column 𝑨 Column 𝑩
Maximum of 𝑧 325
(a) the quantity in column A is greater
(b) the quantity in Column B is greater
(c) the two quantities are equal
(d) the relationship cannot be determined on the basis of information supplied.
7. The solution set of the inequality 2𝑥 + 𝑦 > 5 is
(a) half plane that contains the origin
(b) open half plane not containing the origin
(c) whole 𝑥𝑦-plane except the points lying on the line 2𝑥 + 𝑦 = 5
(d) none of these
8. Objective function of a LPP is
(a) a constraint (b) a function to be optimized
(c) a relation between the variables (d) none of these
9. Which of the following sets are convex
(a) {(𝑥, 𝑦): 𝑥 2 + 𝑦 2 ≥ 1} (b) {(𝑥, 𝑦): 𝑦 2 ≥ 𝑥}
(c) {(𝑥, 𝑦): 3𝑥 2 + 4𝑦 2 ≥ 5} (d) {(𝑥, 𝑦): 𝑦 ≥ 2, 𝑦 ≤ 4}
10. The optimal value of the objective function is attained at the points
(a) given by intersection of inequalities with the axes only
(b) given by intersection of inequalities with x-axis only
(c) given by corner points of the feasible region
(d) none of these
11. Consider a LPP given by
Minimum 𝑍 = 6𝑥 + 10𝑦
Subjected to 𝑥 ≥ 6; 𝑦 ≥ 2; 2𝑥 + 𝑦 ≥ 10; 𝑥, 𝑦 ≥ 0
The redundant constraints in this LPP are
(a) 𝑥 ≥ 0, 𝑦 ≥ 0 (b) 𝑥 ≥ 6, 2𝑥 + 𝑦 ≥ 10
(c) 2𝑥 + 𝑦 ≥ 10 (d) none of these
12. If the constraints in a linear programming problem are changed
(a) the problem is to be re-evaluated
(b) solution is not defined
(c) the objective function has to be modified
(d) the change in constraints is ignored
13. Which of the following statements is correct?
(a) Every LPP admits an optimal solution
(b) A LPP admits unique optimal solution
(c) If a LPP admits two optimal solutions it has an infinite number of optimal solutions
(d) The set of all feasible solutions of a LPP is not a converse set
14. Which of the following is not a convex set
(a) {(𝑥, 𝑦): 2𝑥 + 5𝑦 < 7} (b) {(𝑥, 𝑦)𝑥 2 + 𝑦 2 ≤ 4}
(c) {𝑥: |𝑥| = 5} (d) {(𝑥, 𝑦): 3𝑥 2 + 2𝑦 2 < 6}
15. The region represented by the inequalities 𝑥, 𝑦 ≥ 0, 𝑦 ≤ 6, 𝑥 + 𝑦 < 3 is
(a) unbounded in first quadrant (b) unbounded in first and second quadrants
(c) bounded in first quadrant (d) none of these
16. The value of objective function is maximum under linear constraints
(a) at the centre of feasible region
(b) at (0, 0)
(c) at any vertex of feasible region
(d) the vertex which is at a maximum distance from (0, 0)
17. The graph of the inequality 2𝑥 + 3𝑦 > 6 is
(a) half plane that contains the origin
(b) half plane that neither contains the origin nor the points on line 2𝑥 + 3𝑦 = 6
(c) whole XOY-plane excluding the points on the line 2𝑥 + 3𝑦 = 6
(d) entire XOY plane
18. The objective function of an LPP is
(a) a constant (b) a linear function to be optimized
(c) an inequality (d) a quadratic expression
19. Minimize 𝑧 = ∑𝑛𝑗=1 ∑𝑚 𝑖=1 𝑐𝑖𝑗 𝑥𝑖𝑗
𝑛
Subject to, ∑𝑗=1 𝑥𝑖𝑗 ≤ 𝑎𝑖 ; 𝑖 = 1,2, … , 𝑚
∑𝑚𝑖=1 𝑥𝑖𝑗 = 𝑏𝑖 ; 𝑗 = 1,2, … , 𝑛
is an LPP with number of constraints
𝑚
(a) 𝑚 + 𝑛 (b) 𝑚 − 𝑛 (c) 𝑚𝑛 (d) 𝑛

20. The maximum value of 𝑧 = 4𝑥 + 3𝑦, of the feasible region as shown in the figure is

(a) 100 (b) 72 (c) 112 (d) none of these

ASSERTION – REASON QUESTIONS
Two statements are given, one labelled Assertion (A) and the other labelled Reason (R). Select
the correct answer from the codes (a), (b), (c) and (d) as given below.
(a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of the
Assertion (A).
(b) Both Assertion (A) and Reason (R) are true, but Reason (R) is not the correct explanation of
the Assertion (A).
(c) Assertion (A) is true and Reason (R) is false.
(d) Assertion (A) is false and Reason (R) is true.
21. Assertion (A): If the corner points of the feasible region for a linear programming problem are
𝑃(0, 4), 𝑄(1, 4), 𝑅(4, 1) and 𝑆(12, −1), then minimum value of objective function 𝑍 = 2𝑥 + 4𝑦
is at the point 𝑅(4, 1)
Reason (R): If the corner points of the feasible region for a linear programming
problem 𝑃(0, 4), 𝑄(1, 4), 𝑅(4, 1) and 𝑆(12, −1), then maximum value is 20
22. Assertion (A): The corner points of the feasible region determined by a set constraints (linear
inequalities) are 𝑃(1, 6), 𝑄(4, 5), 𝑅(6, 1) and 𝑆(5, 2) and the objective function is 𝑍 = 𝑎𝑥 + 3𝑏𝑦
where 𝑎, 𝑏 > 0
Reason (R): The relation between a and b such that the maximum 𝑍 occur at 𝑃 and 𝑄 is 𝑎 = 3𝑏
23. Assertion (A): Corner points of feasible region are (0, 0), (3, 0) and (0, 3) and objective
function 𝑍 = 4𝑥 + 7𝑦
Reason (R): Maximum value of Z is 21
24. Assertion (A): The point (4, 2) does not lie in the half plane of 4𝑥 + 6𝑦 − 24 < 0
Reason (R): The point (1, 2) lies in the half plane of 4𝑥 + 6𝑦 − 24 = 0
25. Assertion (A): For a bounded feasible region maximum or minimum of the objective function
lies at the corner points of the feasible region
Reason (R): Assertion is correct as minimum or maximum lies at the corner points of the
feasible region
DESCRIPTIVE TYPE QUESTIONS
Solve the following linear programming problem graphically:
26. Maximise 𝑍 = 4𝑥 + 𝑦
Subject to the constraints:
𝑥 + 𝑦 ≤ 50
3𝑥 + 𝑦 ≤ 90
𝑥 ≥ 0, 𝑦 ≥ 0
27. Minimise 𝑍 = 200𝑥 + 500𝑦
Subject to the constraints
𝑥 + 2𝑦 ≥ 10
3𝑥 + 4𝑦 ≤ 24
𝑥 ≥ 0, 𝑦 ≥ 0
28. Minimise/Maximise 𝑍 = 3𝑥 + 9𝑦
Subject to the constraints:
𝑥 + 3𝑦 ≤ 60
𝑥 + 𝑦 ≥ 10
𝑥≤𝑦
𝑥 ≥ 0, 𝑦 ≥ 0
29. Minimum 𝑍 = −50𝑥 + 20𝑦
Subject to the constraints:
2𝑥 − 𝑦 ≥ −5
3𝑥 + 𝑦 ≥ 3
2𝑥 − 3𝑦 ≤ 12
𝑥 ≥ 0, 𝑦 ≥ 0
30. Minimise 𝑍 = 3𝑥 + 2𝑦
Subject to the constraints:
𝑥+𝑦 ≥8
3𝑥 + 5𝑦 ≤ 15
𝑥 ≥ 0, 𝑦 ≥ 0
31. Minimise/Maximise 𝑍 = 5𝑥 + 10 𝑦
Subject to the constraints:
𝑥 + 2𝑦 ≤ 120,
𝑥 + 𝑦 ≥ 60,
𝑥 – 2𝑦 ≥ 0, 𝑥, 𝑦 ≥ 0
32. Maximise 𝑍 = – 𝑥 + 2𝑦,
Subject to the constraints:
𝑥 ≥ 3,
𝑥 + 𝑦 ≥ 5,
𝑥 + 2𝑦 ≥ 6, 𝑦 ≥ 0.
33. Maximise/Minimise 𝑍 = 3𝑥 + 5𝑦 Subject to the constraints
3𝑥 − 4𝑦 + 12 ≥ 0
2𝑥 − 𝑦 + 2 ≥ 0
2𝑥 + 3𝑦 − 12 ≥ 0
0≤𝑥≤4
𝑦≥2
34. Minimise 𝑍 = 3𝑥 + 5𝑦
Subject to the constraints
−2𝑥 + 𝑦 ≤ 4
𝑥+𝑦 ≥3
𝑥 − 2𝑦 ≤ 2
𝑥, 𝑦 ≥ 0
35. Minimise 𝑍 = 2𝑥 + 4𝑦
Subject to the constraints
𝑥+𝑦 ≥8
𝑥 + 4𝑦 ≥ 12
𝑥 ≥ 3,
𝑦≥2
Solve the following linear programming problem graphically
36. Maximise 𝑍 = 3𝑥 + 4𝑦
Subject to the constraints:
𝑥 + 𝑦 ≤ 4,
𝑥 ≥ 0, 𝑦 ≥ 0
37. Minimise 𝑍 = −3𝑥 + 4𝑦
Subject to the constraints:
𝑥 + 2𝑦 ≤ 8,
3𝑥 + 2𝑦 ≤ 12,
𝑥 ≥ 0, 𝑦 ≥ 0
38. Maximise 𝑍 = 5𝑥 + 3𝑦
Subject to the constraints:
3𝑥 + 5𝑦 ≤ 15,
5𝑥 + 2𝑦 ≤ 10,
𝑥 ≥ 0, 𝑦 ≥ 0
39. Minimise 𝑍 = 3𝑥 + 5𝑦
Subject to the constraints:
𝑥 + 3𝑦 ≥ 3,
𝑥 + 𝑦 ≥ 2,
𝑥 ≥ 0, 𝑦 ≥ 0
40. Maximise 𝑍 = 3𝑥 + 2𝑦
Subject to the constraints:
𝑥 + 2𝑦 ≤ 10,
3𝑥 + 𝑦 ≤ 15,
𝑥 ≥ 0, 𝑦 ≥ 0.
41. Minimise 𝑍 = 𝑥 + 2𝑦
Subject to the constraints:
2𝑥 + 𝑦 ≥ 3,
𝑥 + 2𝑦 ≥ 6,
𝑥 ≥ 0, 𝑦 ≥ 0
42. Minimise/Maximise 𝑍 = 𝑥 + 2𝑦
Subject to the constraints:
𝑥 + 2𝑦 ≥ 100,
2𝑥 – 𝑦 ≤ 0,
2𝑥 + 𝑦 ≤ 200;
𝑥 ≥ 0, 𝑦 ≥ 0.
43. Maximise 𝑍 = 𝑥 + 𝑦,
Subject to the constraints:
𝑥 – 𝑦 ≤ – 1,
– 𝑥 + 𝑦 ≤ 0,
𝑥, 𝑦 ≥ 0