- Practice
- About 25 min
- 15 practice questions
Final self-assessment: Linear programming practice
Test yourself on the whole course: 15 questions with answers explained.
If something looks wrong, please tell us.
Attempt all 15 questions first, under exam conditions if you can (about a minute and a half each), and only then read the explanations. They are a little harder than the lesson checks and mix every method of the course: careful formulation, transportation, the slope ladder, unbounded-region checks and whole-number answers.
Final self-assessment
-
1. Product P needs 12 minutes and product Q needs 18 minutes on a machine that works 3 hours a day. With x of P and y of Q, which constraint is correct?
- 2x + 3y ≤ 3
- 3x + 2y ≤ 30
- 2x + 3y ≤ 30
- 12x + 18y ≤ 3
Show answer
Answer: C. 3 hours = 180 minutes, so 12x + 18y ≤ 180; dividing by 6 gives 2x + 3y ≤ 30. Keeping 3 on the right mixes hours with minutes, and 3x + 2y swaps the times.
-
2. A blend has x kg of tea A and y kg of tea B, and tea B may be at most 60% of the blend. Which constraint is correct?
- 3x − 2y ≥ 0
- 2x − 3y ≥ 0
- 3x − 2y ≤ 0
- 3x − 5y ≥ 0
Show answer
Answer: A. y ≤ 0.6(x + y) gives 0.4y ≤ 0.6x, that is 2y ≤ 3x, or 3x − 2y ≥ 0. Check: x = 2, y = 3 is exactly 60% B and gives 6 − 6 = 0, allowed. 3x − 5y ≥ 0 comes from the trap y ≤ 0.6x.
-
3. A dealer has ₹9000 to buy x fans at ₹600 each and y coolers at ₹1500 each, and room for at most 12 items. Which constraints (with x, y ≥ 0) are correct?
- 5x + 2y ≤ 30 and x + y ≤ 12
- 2x + 5y ≥ 30 and x + y ≤ 12
- 2x + 5y ≤ 30 and x + y ≥ 12
- 2x + 5y ≤ 30 and x + y ≤ 12
Show answer
Answer: D. Money: 600x + 1500y ≤ 9000; divide by 300 to get 2x + 5y ≤ 30. Space: x + y ≤ 12. The distractors swap the prices or reverse one of the two signs.
-
4. Depot A holds 40 units and depot B holds 60. Shops P, Q and R need 30, 40 and 30 units. A sends x to P and y to Q, and everything is delivered. How much does B send to R?
- 10 − x − y
- x + y − 10
- 30 − x − y
- x + y + 10
Show answer
Answer: B. A sends 40 − x − y to R, and R needs 30, so B sends 30 − (40 − x − y) = x + y − 10. Check: B sends (30 − x) + (40 − y) + (x + y − 10) = 60, its whole stock.
-
5. In that problem the constraints are x ≥ 0, y ≥ 0, x + y ≤ 40, x ≤ 30, y ≤ 40 and x + y ≥ 10. Which one can be dropped without changing the feasible region?
- y ≤ 40
- x ≤ 30
- x + y ≤ 40
- x + y ≥ 10
Show answer
Answer: A. From x + y ≤ 40 and x ≥ 0 we get y ≤ 40 automatically, so y ≤ 40 is redundant. The others are not: without x ≤ 30 the point (40, 0) would be allowed; without x + y ≤ 40 the point (30, 40) would be allowed; without x + y ≥ 10 the origin would be allowed.
-
6. With unit costs (₹) A to P 4, A to Q 6, A to R 3, B to P 5, B to Q 4, B to R 2, the total cost simplifies to Z = −2x + y + 410. What is the minimum cost?
- ₹410
- ₹330
- ₹350
- ₹390
Show answer
Answer: C. Z falls as x rises and rises with y, so take x as large as allowed and y = 0: x ≤ 30 gives (30, 0), which satisfies x + y ≤ 40 and x + y ≥ 10. Z = −60 + 410 = 350. ₹330 would need x = 40, which breaks x ≤ 30 (B could not send a negative amount to P).
-
7. The region 2x + y ≤ 14, x + y ≤ 9, x + 3y ≤ 21, x, y ≥ 0 has corners (0, 0), (7, 0), (5, 4), (3, 6) and (0, 7). What is the maximum of Z = 5x + 4y?
- 41
- 39
- 35
- 45
Show answer
Answer: A. Slope of Z is −5/4, between −1 (x + y = 9) and −2 (2x + y = 14), so the optimum is at (5, 4) where those edges meet: Z = 25 + 16 = 41. Check: (3, 6) gives 39 and (7, 0) gives 35. 45 comes from (9, 0), which breaks 2x + y ≤ 14.
-
8. On the same region, at which corner is Z = x + 2y largest?
- (0, 7)
- (3, 6)
- (5, 4)
- (7, 0)
Show answer
Answer: B. Slope −1/2 lies between −1/3 (x + 3y = 21) and −1 (x + y = 9), which meet at (3, 6). Z = 15 there, against 14 at (0, 7) and 13 at (5, 4).
-
9. On the same region, for which objective is (0, 7) the unique maximum?
- Z = x + 2y
- Z = 2x + 3y
- Z = 3x + 2y
- Z = x + 4y
Show answer
Answer: D. (0, 7) is optimal when the slope −p/q is flatter than −1/3, the slope of the top edge x + 3y = 21. Only x + 4y has slope −1/4 > −1/3: it gives 28 at (0, 7) against 27 at (3, 6). x + 2y and 2x + 3y peak at (3, 6), and 3x + 2y at (5, 4).
-
10. Minimise Z = 4x + 3y subject to x + y ≥ 6, 3x + y ≥ 10, x, y ≥ 0.
- 24
- 20
- 30
- No minimum exists
Show answer
Answer: B. Corners: (0, 10), (2, 4) (subtracting gives 2x = 4) and (6, 0), with Z = 30, 20, 24. Combination check: 4x + 3y = (5/2)(x + y) + (1/2)(3x + y) ≥ 15 + 5 = 20, so 20 is the minimum, at (2, 4).
-
11. The region x − y ≤ 2, x + 2y ≥ 5, x, y ≥ 0 is unbounded with corners (0, 5/2) and (3, 1). What is the maximum of Z = x − 3y?
- 0
- −15/2
- No maximum exists
- 3
Show answer
Answer: A. Corner values: −15/2 and 0. From x − y ≤ 2 and x + 2y ≥ 5, 3y ≥ 3, so y ≥ 1, and then x − 3y = (x − y) − 2y ≤ 2 − 2 = 0. The maximum 0 exists, at (3, 1), even though the region is unbounded.
-
12. On the region x + y ≥ 6, 3x + y ≥ 10, x, y ≥ 0, what is the maximum of Z = −4x − 3y?
- −24
- −30
- −20
- No maximum exists
Show answer
Answer: C. Maximising −(4x + 3y) means minimising 4x + 3y, whose minimum is 20 at (2, 4). So the maximum of Z is −20. The unbounded region does not prevent it.
-
13. Maximise Z = 4x + 3y subject to 2x + y ≤ 7, x + 2y ≤ 7, x, y ≥ 0, where x and y are whole numbers. What is the maximum?
- 16
- 49/3
- 14
- 15
Show answer
Answer: D. The LP optimum is at (7/3, 7/3) with Z = 49/3 ≈ 16.3, not a whole-number point. Z = 16 needs 4x + 3y = 16, whose only whole-number solutions with x, y ≥ 0 are (4, 0) and (1, 4), and both break a constraint. Checking nearby points: (3, 1) gives 15 (6 + 1 = 7 and 3 + 2 = 5, both allowed), (2, 2) gives 14, (2, 3) breaks x + 2y ≤ 7. The maximum is 15.
-
14. On the region x + y ≥ 6, 3x + y ≥ 10, x, y ≥ 0, which statement about the minimum of Z = 3x + y is true?
- It is 10, only at (2, 4)
- It is 10, at every point of the segment joining (0, 10) and (2, 4)
- It is 10, only at (0, 10)
- There is no minimum because the region is unbounded
Show answer
Answer: B. Z = 3x + y is exactly the left side of the constraint 3x + y ≥ 10, so Z ≥ 10 everywhere, with equality along the edge of that line inside the region: from (0, 10) to (2, 4). The corner (6, 0) gives 18.
-
15. For which value of c does the system x + y ≤ 4, 2x + 3y ≥ c, x ≥ 0, y ≥ 0 have NO feasible point?
- c = 12
- c = 8
- c = 13
- c = 10
Show answer
Answer: C. On x + y ≤ 4 the largest value of 2x + 3y is 12, at (0, 4) (2x + 3y = 2(x + y) + y ≤ 8 + 4). So 2x + 3y ≥ c can be met when c ≤ 12 and not when c > 12. Of the options only c = 13 gives an empty region; c = 12 leaves the single point (0, 4).
Questions 1-3: lesson 1 (formulation traps). Questions 4-6: lesson 2 (transportation and allocation). Questions 7-9: lesson 3 (iso-profit lines and the slope ladder). Questions 10-12: lesson 4 (unbounded regions). Questions 13-15: lesson 5 (whole-number answers, multiple optima and infeasibility). Revisit the lesson for any question you got wrong.
Sign in to keep track of the lessons you finish.