Linear Programming

MCQ Questions
1. 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 Z = 4x + 3y.
Compare the quantity in Column A and Column B

Column A Column B

Maximum of Z 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 the information supplied.

2. The feasible solution for a LPP is shown in given figure. 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)
3. Refer to Q. 2 of multiple choice questions, maximum of Z occurs at
(A) (5,0)
(B) (6,5)
(C) (6,8)
(D) (4,10)

4. Refer to Q.2 of multiple choice questions, (Maximum value of Z + Minimum value of Z ) is

equal to-
(A) 13
(B) 1
(C) -13
(D) -17

5. The feasible region for an LPP is shown in the given figure. Let F = 3x − 4y be the objective
function. Maximum value of F is-

(A) 0
(B) 8
(C) 12
(D) -18

6. Refer to Q.5 of multiple choice questions, minimum value of 𝐹 is-

(A) 0
(B) -16
(C) 12
(D) does not exist

7. Corner points of the feasible region for an LPP are (0,2), (3,0), (6,0), (6,8) and (0,5). Let F =
4x + 6y be the objective function.

The minimum value of F 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)

8. Refer to Q. 7 above, Maximum of F - Minimum of F =

(A) 60
(B) 48
(C) 42
(D) 18

9. Corner points of the feasible region determined by the system of linear constraints are
(0,3), (1,1) and (3,0). Let 𝑍 = 𝑝𝑥 + 𝑞𝑦, where 𝑝, 𝑞 > 0. Condition on 𝑝 and 𝑞 so that the
minimum of Z occurs at (3,0) and (1,1) is
(A) 𝑝 = 2𝑞
(B) 𝑝 = 𝑞/2
(C) 𝑝 = 3𝑞
(D) 𝑝 = 𝑞

CASE BASED MCQ's

Passage -1 [10 to 14]

A dealer in rural area wishes to purchase a number of sewing machines. He has only ₹5,760 to invest
and has space for at most 20 items for storage. An electronic sewing machine cost him ₹360 and a
manually operated sewing machine ₹240. He can sell an electronic sewing machine at a profit of ₹22
and a manually operated machine at a profit of ₹18. Assume that the electronic sewing machines he can
sell is x and that of manually operated machines is y.

10. The objective function is

(A) Maximise Z = 360x + 240y
(B) Maximise Z = 22x + 18y
(C) Minimise 𝑍 = 360𝑥 + 240𝑦
(D) Minimise Z = 22x + 18y

11. The maximum value of 𝑥 + 𝑦 is

(A) 5760
 (B) 18
(C) 22
(D) 20

12. Which of the following is not a constraint?

(A) 𝑥 + 𝑦 ≥ 20
(B) 360x + 240y ≤ 5,760
(C) x ≥ 0
(D) y ≥ 0

13. The profit is maximum when (x, y) =

(A) (5,15)
(B) (8,12)
(C) (12,8)
(D) (15,5)

14. The maximum profit is ₹

(A) 5,760
(B) 392
(C) 362
(D) 290

Passage -2 [15 to 19]

Linear programming is a method for finding the optimal values (maximum or minimum) of quantities
subject to the constraints when relationship is expressed as linear equations or inequations.

Based on the above information, answer the following questions.

15. The optimal value of the objective function is attained at the points-
(A) on X-axis
(B) on Y-axis
(C) which are corner points of the feasible region
(D) none of these

16. The graph of the inequality 3𝑥 + 4𝑦 < 12 is-

(A) half plane that contains the origin
(B) half plane that neither contains the origin nor the points of the line 3x + 4y = 12
(C) whole XOY-plane excluding the points on line 3x + 4y = 12
(D) none of these

17. The feasible region for an LPP is shown in the figure. Let 𝑍 = 2𝑥 + 5𝑦 be the objective
function. Maximum of Z occurs at-
 (A) (7,0)
(B) (6,3)
(C) (0,6)
(D) (4,5)

18. 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 Z occurs at both the points (15,15) and (0,20) is-
(A) p = q
(B) 𝑝 = 2𝑞
(C) 𝑞 = 2𝑝
(D) 𝑞 = 3𝑝
19. 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 Z = 4x + 3y.
Compare the quantity in column A and column B

Column A Column B

Maximum of Z 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 the information supplied

Passage -3 [20 to 24]

Deepa rides her car at 25 km/hr. She has to spend ₹2 per km on diesel and if she rides it at a faster
speed of 40 km/hr, the diesel cost increases to ₹5 per km. She has ₹100 to spend on diesel. Let she
travels xkms with speed 25 km/hr and ykms with speed 40 km/hr. The feasible region for the LPP is
shown below:
Based on the above information, answer the following questions.

20. What is the point of intersection of line 𝑙1 and 𝑙2

40 50
(A) ( , )
3 3
50 40
(B) ( , )
3 3
−50 40
(C) ( , )
3 3
−50 −40
(D) ( , )
3 3

21. The corner points of the feasible region shown in above graph are-
40 50
(A) (0,25), (20,0), ( , )
3 3
(B) (0,0), (25,0), (0,20)
40 50
(C) (0,0), ( , ) , (0,20)
3 3
50 40
(D) (0,0), (25,0), ( , ) , (0,20)
3 3

22. If 𝑍 = 𝑥 + 𝑦 be the objective function and max. Z = 30. The maximum value occurs at point-
50 40
(A) ( , )
3 3
(B) (0,0)
(C) (25,0)
(D) (0,20)

23. If 𝑍 = 6𝑥 − 9𝑦 be the objective function, then maximum value of Z is-

(A) -20
(B) 150
(C) 180
(D) 20
 24. If 𝑍 = 6𝑥 + 3𝑦 be the objective function, then what is the minimum value of Z ?
(A) 120
(B) 130
(C) 0
(D) 150

Passage -4 [25 to 29]

Corner points of the feasible region for an LPP are (0,3), (5,0), (6,8), (0,8). Let 𝑍 = 4𝑥 − 6𝑦 be the
objective function.

Based on the above information, answer the following questions.

25. The minimum value of Z occurs at -

(A) (6,8)
(B) (5,0)
(C) (0,3)
(D) (0,8)

26. Maximum value of 𝑍 occurs at

(A) (5,0)
(B) (0,8)
(C) (0,3)
(D) (6,8)

27. Maximum of Z − Minimum of Z =

(A) 58
(B) 68
(C) 78
(D) 88

28. The corner points of the feasible region determined by the system of linear inequalities are-
 (A) (0,0), (−3,0), (3,2), (2,3)
(B) (3,0), (3,2), (2,3), (0, −3)
(C) (0,0), (3,0), (3,2), (2,3), (0,3)
(D) None of these

29. The feasible solution of LPP belongs to-

(A) first and second quadrant
(B) first and third quadrant
(C) only second quadrant
(D) only first quadrant

Passage -5 [30 to 34]

A fruit grower can use two types of fertilizer in his garden, brand P and Q. The amounts (in kg ) of
nitrogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table. Tests
indicate that the garden needs at least 240 kg of phosphoric acid, at least 270 kg of phosphoric acid, at
least 270 kg of potash and at most 310 kg of chlorine.

kg per bag
Brand P Brand Q
Nitrogen 3 3.5
Phosphoric acid 1 2
Potash 3 1.5
Chlorine 1.5 2

30. The objective function to minimise the amount of nitrogen added to garden?
(A) Maximise Z = 3x + 4y
(B) Minimise Z = 3x + 3.5y
(C) Maximise 𝑍 = 4𝑥 + 3.5𝑦
(D) Minimise Z = 3x + 4y

31. If the grower wants to minimise the amount of nitrogen added to the garden, how many bags of
brand P should be used?
(A) 40
(B) 50
(C) 100
(D) 60

32. If the grower wants to minimise the amount of nitrogen added to the garden, how many bags of
brand Q should be used?
(A) 40
(B) 50
(C) 100
(D) 60
 33. What is the minimum amount of nitrogen added in the garden?
(A) 595 kg
(B) 550 kg
(C) 400 kg
(D) 470 kg

34. What is the total number of bags used by fruit grower to minimize the amount of nitrogen?
(A) 160
(B) 190
(C) 140
(D) 130

ASSERTION & REASON BASED MCQ'S

Directions: In the following questions, a statement of Assertion (A) is followed by a statement of
Reason (R). Mark the correct choice as:

(A) Both assertion (A) and reason (R) are true and (𝑅) is correct explanation of assertion (A).

(B) Both assertion (A) and reason (R) are true, but reason (𝑅) is not the correct explanation of assertion
(A).

(C) Assertion (A) is true, but reason (R) is false.

(D) Assertion (A) is false, but reason (R) is true.

35. Assertion (A): Feasible region is the set of points which satisfy all of the given constraints and
objective function too.

Reason (R): The optimal value of the objective function is attained at the points on X-axis only.

36. Assertion (A): The intermediate solutions of constraints must be checked by substituting them
back into objective function.

Reason (R):

Here (0,2); (0,0) and (3,0) all are vertices of feasible region.
37. Assertion (A): For the constraints of linear optimizing function Z = x1 + x 2 given by x1 + x 2 ≤
1, 3𝑥1 + 𝑥2 ≥ 1, there is no feasible region.

Reason (R): Z = 7x + y, subject to 5x + y ≤ 5, 𝑥 + 𝑦 ≥ 3, 𝑥 ≥ 0, 𝑦 ≥ 0. Out of the corner

1 5
points of feasible region (3,0), ( , ) , (7,0) and (0,5), the maximum value of Z occurs at (7,0).
2 2

38. Assertion (A): 𝑍 = 20𝑥1 + 20𝑥2 , subject to 𝑥1 ≥ 0, x 2 ≥ 2, x1 + 2x 2 ≥ 8,3x1 + 2x 2 ≥

5 15 7 9
15,5x1 + 2x 2 ≥ 20. Out of the corner points of feasible region (8,0), ( , ) , ( , ) and (0,10),
2 2 2 4
7 9
the minimum value of Z occurs at ( , ).
2 4

Reason (R):

Corner Points 𝐙 = 𝟐𝟎𝐱𝟏 + 𝟐𝟎𝐱𝟐

(8,0) 160

5 15
( , ) 125
2 4

7 9
( , ) 115 minimum
2 4

(0,10) 200

39. Assertion (A): For the constraints of a LPP problem given by

x1 + 2x 2 ≤ 2000, x1 + x 2 ≤ 1500, x 2 ≤ 600 and x1 , x 2 ≥ 0, the points
(1000,0), (0,500), (2,0) lie in the positive bounded region, but point (2000,0) does not lie in
the positive bounded region.

Reason (R):
From the graph, it is clear that the point (2000,0) is outside.