CH 12 LINEAR PROGRAMMING
CH 12 LINEAR PROGRAMMING
6 If a point (h, k) satisfies an inequation 𝑎𝑥 + 𝑏𝑦 ≥ 4, then the half plane represented by the
inequation is
(a) The half plane containing the point (h, k) but excluding the points on 𝑎𝑥 + 𝑏𝑦 = 4
(b) The half plane containing the point (𝐡, 𝐤) and the points on 𝒂𝒙 + by = 𝟒
(c) Whole xy-plane
(d) None of these
(a) 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎, 𝟑𝒙 + 𝟐𝒚 ≥ 𝟏𝟐, 𝒙 + 𝟑𝒚 ≥ 𝟏𝟏
(b) 𝑥 ≥ 0, 𝑦 ≥ 0,3𝑥 + 2𝑦 ≤ 12, 𝑥 + 3𝑦 ≥ 11
(a) (0,0)
(b) (𝟎, 𝟖)
(c) (5,0)
(d) (4,10)
13 Region represented by 𝑥 ≥ 0, 𝑦 ≥ 0 is
(a) first quadrant
(b) second quadrant
(c) third quadrant
(d) fourth quadrant
14 Feasible region for an LPP is shown shaded in the following figure. Minimum of 𝑍 = 4𝑥 + 3 y
occurs at the point.
(a) (0,8)
(b) (𝟐, 𝟓)
(c) (4,3)
(d) (9,0)
15 The feasible region for LPP is shown shaded in the figure. Let 𝑓 = 3𝑥 − 4𝑦 be the objective
function, then maximum value of 𝑓 is
(a) 12
(b) 8
(c) 0
(d) -18
19 Shamli wants to invest ‘50,000 in saving certificates and PPE. She wants to invest atleast '
15,000 in saving certificates and at least `20,000 in PPF. The rate of interest on saving
certificates is 8% p.a. and that on PPF is 9% p.a. Formulation of the above problem as LPP to
determine maximum yearly income, is
20. 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.
21 The point at which the maximum value of (3𝑥 + 2𝑦) subject to the constraints 𝑥 + 𝑦 ≤ 2, 𝑥 ≥
0, 𝑦 ≥ 0 is obtained, is
(a) (0,0)
(b) (1.5,1.5)
(c) (𝟐, 𝟎)
(d) (0,2)
22 For the constraint of a linear optimizing function 𝑧 = 𝑥1 + 𝑥2 , given by 𝑥1 + 𝑥2 ≤ 1,3𝑥1 + 𝑥2 ≥
3 and 𝑥1 , 𝑥2 ≥ 0,
(a) There are two feasible regions
(b) There are infinite feasible regions
(c) There is no feasible region
(d) None of these.
23 Which of the following is not a vertex of the positive region bounded by the inequalities 2𝑥 +
3𝑦 ≤ 6,5𝑥 + 3𝑦 ≤ 15 and x, y ≥ 0 ?
(a) (0,2)
(b) (0,0)
(c) (3,0)
(d) None
24 The area of the feasible region for the following constraints 3𝑦 + 𝑥 ≥ 3, 𝑥 ≥ 0, 𝑦 ≥ 0 will be
(a) Bounded
(b) Unbounded
(c) Convex
(d) Concave
28 A wholesale merchant wants to start the business of cereal with 2 24000 . Wheat is 400 per
quintal and rice is 600 per quintal. He has capacity to store 200 quintal cereal. He earns the profit
‘25 per quintal on wheat and 40 per quintal on rice. If he store x quintal rice and y quintal wheat,
then for maximum profit, the objective function is
(a) 25𝑥 + 40𝑦
(b) 𝟒𝟎𝒙 + 𝟐𝟓𝒚
(c) 400𝑥 + 600𝑦
400 600
(d) 𝑥+ 𝑦
40 25
(a)
(b)
(c)
(d)
36 Consider the objective function Z = 40x + 50y. The minimum number of constraints that are
required to maximize Z are
(a) 4
(b) 2
(c) 3
(d) 1
37 The no. of convex polygon formed bounding the feasible region of the L.P.P. Max. 𝑍 = 30𝑥 +
60𝑦 subject to the constraints 5𝑥 + 2𝑦 ≤ 10, 𝑥 + 𝑦 ≤ 4, 𝑥 ≥ 0, 𝑦 ≥ 0 are
(a) 2
(b) 3
(c) 4
(d) 1
is bounded by
(a) 4 straight lines
(b) 5 straight lines
(c) 6 straight lines
(d) unbounded
42 Corner points of the feasible region determined by the system of linear constraints are
(0,3), (1,1) and (3,0). Let Z = px + qy, where p, q > 0. Condition on p and q so that the
minimum of 𝑍 occurs at (3,0) and (1,1) is
(a) 𝑝 = 2𝑞
𝐪
(b) 𝐩 =
𝟐
(c) 𝑝 = 3𝑞
(d) p = q
43 The corner points of the feasible region determined by the system of linear constraints are
(0,10), (5,5)(15,15), (0,20). Let Z = px + qy, where p, q > 0. Condition on p and q so that the
maximum of 𝑍 occurs at both the points (15,15) and (0,20) is
(a) 𝑝 = 𝑞
(b) 𝑝 = 2𝑞
(c) q = 2p
(d) 𝐪 = 𝟑𝐩
44 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.
(c) the mid point of the line segment joining the points (0,2) and (3,0).
(d) any point on the line segment joining the points (𝟎, 𝟐) and (𝟑, 𝟎).
45 The region represented by the inequalities 𝑥 ≥ 6, 𝑦 ≥ 2, 2𝑥 + 𝑦 ≤ 10, 𝑥 ≥ 0, 𝑦 ≥ 0 is
(a) unbounded
(b) a polygon
(c) exterior of a triangle
(d) None of these
48 A company manufactures two types of products A and B. The storage capacity of its godown is
100 units. Total investment amount is `30,000. The cost price of A and B are ' 400 and ' 900
respectively. Suppose all the products have sold and per unit profit is ' 100 and ' 120 through A
and 𝐵 respectively. If 𝑥 units of 𝐴 and 𝑦 units of 𝐵 be produced, then two linear constraints and
iso-profit line are respectively
(a) 𝑥 + 𝑦 = 100; 4𝑥 + 9𝑦 = 300,100𝑥 + 120𝑦 = 𝑐
(b) 𝑥 + 𝑦 ≤ 100; 4𝑥 + 9𝑦 ≤ 300, 𝑥 + 2𝑦 = 𝑐
(c) 𝒙 + 𝒚 ≤ 𝟏𝟎𝟎; 𝟒𝒙 + 𝟗𝒚 ≤ 𝟑𝟎𝟎, 𝟏𝟎𝟎𝒙 + 𝟏𝟐𝟎𝒚 = 𝒄
(d) 𝑥 + 𝑦 ≤ 100; 9𝑥 + 4𝑦 ≤ 300, 𝑥 + 2𝑦 = 𝑐
49 Which of the following cannot be considered as the objective function of a linear programming
problem?
(a) Maximize 𝑧 = 3𝑥 + 2𝑦
(b) Minimize 𝑧 = 6𝑥 + 7𝑦 + 9𝑧
(c) Maximize 𝑧 = 2𝑥
(d) Minimize 𝒛 = 𝒙𝟐 + 𝟐𝒙𝒚 + 𝒚𝟐
50 Inequation 𝑦 − 𝑥 ≤ 0 represents
(a) The half plane that contains the positive 𝑿-axis
(b) Closed half plane above the line 𝑦 = 𝑥, which contains positive Y-axis
(c) Half plane that contains the negative X-axis
(d) None of these
(a)
(b)
(c)
(d)
52 The linear inequations for which the shaded area in the following figure is the solution set, are
(a) 𝑥 + 𝑦 ≤ 1,2𝑥 + 𝑦 ≥ 2, 𝑥 − 2𝑦 ≥ 8, 𝑥 ≤ 0, 𝑦 ≥ 0
(b) 𝑥 − 𝑦 ≥ 1,2𝑥 + 𝑦 ≥ 2, 𝑥 + 2𝑦 ≥ 8, 𝑥 ≥ 0, 𝑦 ≥ 0
(c) 𝒙 − 𝒚 ≤ 𝟏, 𝟐𝒙 + 𝒚 ≥ 𝟐, 𝒙 + 𝟐𝒚 ≤ 𝟖, 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎
(d) 𝑥 + 𝑦 ≥ 1,2𝑥 + 𝑦 ≤ 2, 𝑥 + 2𝑦 ≥ 8, 𝑥 ≥ 0, 𝑦 ≥ 0