0% found this document useful (0 votes)
21 views13 pages

CH 12 LINEAR PROGRAMMING

The document outlines various concepts and problems related to Linear Programming (L.P.P), including the identification of objective functions, constraints, and feasible regions. It presents multiple-choice questions that test understanding of key principles such as maximizing or minimizing objective functions, corner points of feasible regions, and the formulation of linear programming problems. The document serves as a study guide for individuals looking to enhance their knowledge and problem-solving skills in linear programming.

Uploaded by

satyanshukumar99
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views13 pages

CH 12 LINEAR PROGRAMMING

The document outlines various concepts and problems related to Linear Programming (L.P.P), including the identification of objective functions, constraints, and feasible regions. It presents multiple-choice questions that test understanding of key principles such as maximizing or minimizing objective functions, corner points of feasible regions, and the formulation of linear programming problems. The document serves as a study guide for individuals looking to enhance their knowledge and problem-solving skills in linear programming.

Uploaded by

satyanshukumar99
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

LINEAR PROGRAMMING

1 L.P.P is a process of finding


(a) Maximum value of objective function
(b) Minimum value of objective function
(c) Optimum value of objective function
(d) None of these

2 L.P.P. has constraints of


(a) one variables
(b) two variables
(c) one or two variables
(d) two or more variables

3 Corner points of feasible region of inequalities gives


(a) optional solution of L.P.P.
(b) objective function
(c) constraints.
(d) linear assumption

4 The optimal value of the objective function is attained at the points


(a) Given by intersection of inequations with axes only
(b) Given by intersection of inequations with x - axis only
(c) Given by corner points of the feasible region
(d) None of these.

5 Which of the following statement is correct?


(a) Every L.P.P. admits an optimal solution
(b) A L.P.P. admits a unique optimal solution
(c) If a L.P.P. admits two optimal solutions, it has an infinite number of optimal solutions
(d) The set of all feasible solutions of a L.P.P. is not a convex set.

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

7 Shaded region is represented by


(a) 4𝑥 − 2𝑦 ≤ 3
(b) 4𝑥 − 2𝑦 ≤ −3
(c) 4𝑥 − 2𝑦 ≥ 3
(d) 𝟒𝒙 − 𝟐𝒚 ≥ −𝟑

8 The maximum value of 𝑧 = 5𝑥 + 2𝑦, subject to the constraints 𝑥 + 𝑦 ≤ 7, 𝑥 + 2𝑦 ≤ 10, 𝑥, 𝑦 ≥


0 is
(a) 10
(b) 26
(c) 35
(d) 70

9 The maximum value of 𝑃 = 𝑥 + 3𝑦 such that 2𝑥 + 𝑦 ≤ 20, 𝑥 + 2𝑦 ≤ 20, 𝑥 ≥ 0, 𝑦 ≥ 0 is


(a) 10
(b) 60
(c) 30
(d) None of these

10 For the following feasible region, the linear constraints are

(a) 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎, 𝟑𝒙 + 𝟐𝒚 ≥ 𝟏𝟐, 𝒙 + 𝟑𝒚 ≥ 𝟏𝟏
(b) 𝑥 ≥ 0, 𝑦 ≥ 0,3𝑥 + 2𝑦 ≤ 12, 𝑥 + 3𝑦 ≥ 11

(c) 𝑥 ≥ 0, 𝑦 ≥ 0,3𝑥 + 2𝑦 ≤ 12, 𝑥 + 3𝑦 ≤ 11

(d) None of these

11 Objective function of a L.P.P. is


(a) a constant
(b) a function to be optimised
(c) a relation between the variables
(d) None of these
12 The feasible region for an LPP is shown shaded in the figure. Let 𝑍 = 3𝑥 − 4 be the objective
function. Minimum of 𝑍 occurs at

(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

16 Maximize 𝑍 = 3𝑥 + 5𝑦, subject to 𝑥 + 4𝑦 ≤ 24,3𝑥 + 𝑦 ≤ 21, 𝑥 + 𝑦, ≤ 9, 𝑥 ≥ 0, 𝑦 ≥ 0, is


(a) 20 at (1,0)
(b) 30 at (0,6)
(c) 37 at (𝟒, 𝟓)
(d) 33 at (6,3)

17 𝑍 = 6𝑥 + 21𝑦, subject to 𝑥 + 2𝑦 ≥ 3, 𝑥 + 4𝑦 ≥ 4,3𝑥 + 𝑦 ≥ 3, 𝑥 ≥ 0, 𝑦 ≥ 0. The minimum


value of 𝑍 occurs at
(a) (4,0)
(b) (28,8)
𝟏
(c) (𝟐, )
𝟐
(d) (0,3)

18 Maximize 𝑍 = 4𝑥 + 6𝑦, subject to 3𝑥 + 2𝑦 ≤ 12, 𝑥 + 𝑦 ≥ 4, x, y ≥ 0, is


(a) 16 at (4,0)
(b) 24 at (0,4)
(c) 24 at (6,0)
(d) 36 at (𝟎, 𝟔)

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

(a) Maximize 𝐙 = 𝟎. 𝟎𝟖𝐱 + 𝟎. 𝟎𝟗𝐲

Subject to, 𝒙 + 𝒚 ≤ 𝟓𝟎, 𝟎𝟎𝟎, 𝒙 ≥ 𝟏𝟓𝟎𝟎𝟎, 𝒚 ≥ 𝟐𝟎, 𝟎𝟎𝟎

(b) Maximize Z = 0.08x + 0.09𝑦

Subject to, 𝑥 + 𝑦 ≤ 50,000, 𝑥 ≥ 15000, 𝑦 ≤ 20,000

(c) Maximize Z = 0.08x + 0.09y

Subject to, 𝑥 + 𝑦 ≤ 50,000, 𝑥 ≤ 15000, 𝑦 ≥ 20,000

(d) Maximize Z = 0.08x + 0.09y

Subject to, 𝑥 + 𝑦 ≤ 50,000, 𝑥 ≤ 15000, 𝑦 ≤ 20,000

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.

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 (𝟎, 𝟐) and (𝟑, 𝟎)

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

25 The maximum value of 𝑧 = 4𝑥 + 2𝑦 subject to constraints 2𝑥 + 3𝑦 ≤ 18, 𝑥 + 𝑦 ≥ 10 and


𝑥, 𝑦 ≥ 0, is
(a) 36
(b) 40
(c) 20
(d) None

26 The maximum value of 𝑃 = 𝑥 + 3𝑦 such that 2𝑥 + 𝑦 ≤ 20, 𝑥 + 2𝑦 ≤ 20, 𝑥 ≥ 0, 𝑦 ≥ 0 is


(a) 10
(b) 60
(c) 30
(d) None

27 The maximum value of 𝑧 = 6𝑥 + 8𝑦 subject to constraints 2𝑥 + 𝑦 ≤ 30, 𝑥 + 2𝑦 ≤ 24 and 𝑥 ≥


0, 𝑦 ≥ 0 is
(a) 90
(b) 120
(c) 96
(d) 240

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

29 The value of objective function is maximum under linear constraints, is


(a) At the centre of feasible region
(b) At⁡(0,0)
(c) At any vertex of feasible region
(d) The vertex which is at maximum distance from (0,0)

30 The feasible solution of a L.P.P. belongs to


(a) Only first quadrant
(b) First and third quadrant
(c) Second quadrant
(d) Any quadrant
𝑥 𝑦
31 Graph of the constraints + ≤ 1, 𝑥 ≥ 0, 𝑦 ≥ 0 is
3 4

(a)

(b)

(c)
(d)

32 The lines 5𝑥 + 4𝑦 ≥ 20, 𝑥 ≤ 6, 𝑦 ≤ 4 form


(a) A square
(b) A rhombus
(c) A triangle
(d) A quadrilateral

33 The graph of inequations 𝑥 ≤ 𝑦 and 𝑦 ≤ 𝑥 + 3 is located in


(a) II quadrant
(b) I, II quadrants
(c) I, II, III quadrants
(d) II, III, IV quadrants

34 A linear programming of linear functions deals with


(a) Minimizing
(b) Optimizing
(c) Maximizing
(d) None of these

35 The number of corner points of the L.P.P.


Max⁡ 𝑍 = 20𝑥 + 3𝑦 subject to the constraints 𝑥 + 𝑦 ≤ 5,2𝑥 + 3𝑦 ≤ 12, 𝑥 ≥ 0, 𝑦 ≥ 0 are
(a) 4
(b) 3
(c) 2
(d) 1

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

38 Shaded region in the following figure is represented by

(a) 2𝑥 + 5𝑦 ≥ 80, 𝑥 + 𝑦 ≤ 20, 𝑥 ≥ 0, 𝑦 ≤ 0


(b) 2𝑥 + 5𝑦 ≥ 80, 𝑥 + 𝑦 ≥ 20, 𝑥 ≥ 0, 𝑦 ≥ 0
(c) 𝟐𝒙 + 𝟓𝒚 ≤ 𝟖𝟎, 𝒙 + 𝒚 ≤ 𝟐𝟎, 𝒙 ≥ 𝟎, 𝒚 ≥ 𝟎
(d) 2𝑥 + 5𝑦 ≤ 80, 𝑥 + 𝑦 ≤ 20, 𝑥 ≤ 0, 𝑦 ≤ 0

39 The maximum value of 𝑧 = 2𝑥 + 5𝑦 subject to the constraints 2𝑥 + 5𝑦 ≤ 10, 𝑥 + 2𝑦 ≥ 1, 𝑥 −


𝑦 ≤ 4, 𝑥 ≥ 𝑦 ≥ 0, occurs at
(a) exactly one point
(b) exactly two points
(c) infinitely many points
(d) None of these

40 Consider Max. z = −2x − 3y subject to


x y x y
+ ≤ 1, + ≤ 1, x, y ≥ 0
2 3 3 2
The max value of z is :
(a) 0
(b) 4
(c) 9
(d) 6

41 The solution region satisfied by the inequalities 𝑥 + 𝑦 ≤ 5, 𝑥 ≤ 4, 𝑦 ≤ 4


𝑥 ≥ 0, 𝑦 ≥ 0,5𝑥 + 𝑦 ≥ 5, 𝑥 + 6𝑦 ≥ 6,

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.

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).

(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

46 𝑍 = 7𝑥 + 𝑦, subject to 5𝑥 + 𝑦 ≥ 5, 𝑥 + 𝑦 ≥ 3, 𝑥 ≥ 0, 𝑦 ≥ 0. The minimum value of 𝑍 occurs at


(a) (3,0)
1 5
(b) ( , 2)
2
(c) (7,0)
(d) (𝟎, 𝟓)

47 The solution set of the following system of inequations:


𝑥 + 2𝑦 ≤ 3,3𝑥 + 4𝑦 ≥ 12, 𝑥 ≥ 0, 𝑦 ≥ 1, is
(a) bounded region
(b) unbounded region
(c) only one point
(d) empty set

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

51 Graph of the inequalities 𝑥 ≥ 0, 𝑦 ≥ 0,2𝑥 + 3𝑦 ≥ 6,3𝑥 + 2𝑦 ≥ 6 is

(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

You might also like