- Foundation
- About 25 min
- 15 practice questions
Final self-assessment: Linear programming basics
Test yourself on the whole course: 15 questions with answers explained.
If something looks wrong, please tell us.
Attempt all 15 questions first, writing down your answer and the corner points or check you used, and only then read the explanations. The questions are a little harder than the lesson checks and mix every idea of the course, so read each condition carefully and test every intersection before you use it.
Final self-assessment
-
1. Which inequality describes the side of the line through (2, 0) and (0, −3) that does NOT contain the origin, with the line excluded?
- 3x − 2y > 6
- 3x − 2y < 6
- 3x − 2y ≥ 6
- 2x − 3y > 6
Show answer
Answer: A. Intercepts 2 and −3 give x/2 + y/(−3) = 1; multiply by 6: 3x − 2y = 6 (check (0, −3): 0 + 6 = 6). The origin gives 0 < 6, so the side without the origin is 3x − 2y > 6. The line is excluded, so the sign is strict, not ≥.
-
2. Which of these points lies in the region 4x − 3y ≥ 12?
- (0, −3)
- (2, −1)
- (1, −2)
- (3, 0)
Show answer
Answer: D. Substitute: (0, −3) gives 9, (2, −1) gives 8 + 3 = 11, (1, −2) gives 4 + 6 = 10, all less than 12. (3, 0) gives exactly 12, and 12 ≥ 12 is true because the boundary is included.
-
3. Which inequality describes the region on or below the line y = 2x + 1?
- 2x − y ≤ −1
- y ≥ 2x + 1
- 2x − y ≥ −1
- x − 2y ≥ −1
Show answer
Answer: C. On or below the line means y ≤ 2x + 1. Move y to the right: 0 ≤ 2x − y + 1, that is 2x − y ≥ −1. Check with (0, 0), which is below the line: 0 ≥ −1 is true. 2x − y ≤ −1 is the region above the line.
-
4. How many corner points does the region x + y ≥ 2, x + y ≤ 6, x ≤ 4, x ≥ 0, y ≥ 0 have?
- 3
- 4
- 5
- 6
Show answer
Answer: C. The corners are (2, 0), (4, 0), (4, 2), (0, 6) and (0, 2): five in all. The region is the strip between the two parallel lines x + y = 2 and x + y = 6, cut off by x = 4 and the axes. Parallel lines never meet, so they give no corner.
-
5. For the region x + 2y ≤ 8, 3x + y ≤ 9, x ≥ 0, y ≥ 0, which of these is NOT a corner point?
- (3, 0)
- (8, 0)
- (2, 3)
- (0, 4)
Show answer
Answer: B. (8, 0) is where x + 2y = 8 meets the x-axis, but 3 × 8 + 0 = 24 breaks 3x + y ≤ 9, so it is outside the region. The lines meet at (2, 3) (x = 8 − 2y gives 24 − 5y = 9, y = 3), and (3, 0), (0, 4) are feasible intercepts.
-
6. The feasible region of x − y ≥ 1, x + y ≤ 3, x ≥ 0, y ≥ 0 is:
- an unbounded region
- the triangle with corners (1, 0), (3, 0) and (2, 1)
- empty
- the quadrilateral with corners (0, 0), (1, 0), (2, 1) and (0, 3)
Show answer
Answer: B. x − y = 1 meets x + y = 3 at (2, 1). On the x-axis, x − y ≥ 1 needs x ≥ 1 and x + y ≤ 3 needs x ≤ 3, giving (1, 0) and (3, 0). The origin breaks x − y ≥ 1, so it is not in the region. The region is the triangle (1, 0), (3, 0), (2, 1).
-
7. A company makes x units of P and y units of Q. Each P needs 2 kg of material and each Q needs 3 kg, with 60 kg available. At least 5 units of P must be made, and the output of Q must not exceed that of P. Which constraints are correct?
- 2x + 3y ≥ 60, x ≥ 5, y ≤ x, y ≥ 0
- 2x + 3y ≤ 60, x ≤ 5, y ≤ x, y ≥ 0
- 2x + 3y ≤ 60, x ≥ 5, y ≥ x, y ≥ 0
- 2x + 3y ≤ 60, x ≥ 5, y ≤ x, y ≥ 0
Show answer
Answer: D. Material used 2x + 3y cannot exceed 60: ≤. "At least 5 of P": x ≥ 5 (which also makes x ≥ 0). "Q must not exceed P": y ≤ x. Each distractor reverses exactly one of these.
-
8. Brand P fertiliser has 3 units of nitrogen per bag and costs ₹200; brand Q has 1 unit per bag and costs ₹150. At least 12 units of nitrogen are needed and at most 10 bags can be stored. With x bags of P and y of Q, which LPP is correct?
- Minimise 200x + 150y subject to 3x + y ≥ 12, x + y ≤ 10, x, y ≥ 0
- Maximise 200x + 150y subject to 3x + y ≥ 12, x + y ≤ 10, x, y ≥ 0
- Minimise 200x + 150y subject to x + 3y ≥ 12, x + y ≤ 10, x, y ≥ 0
- Minimise 200x + 150y subject to 3x + y ≤ 12, x + y ≥ 10, x, y ≥ 0
Show answer
Answer: A. Cost is minimised. Nitrogen: 3 per bag of P and 1 per bag of Q, at least 12, so 3x + y ≥ 12. Storage: at most 10 bags, x + y ≤ 10. The other options maximise cost, swap the nitrogen contents, or reverse both signs.
-
9. A tailor makes x shirts and y trousers. The number of trousers must be at least 3 more than the number of shirts. Which constraint is correct?
- x ≥ y + 3
- y ≥ x + 3
- y + 3 ≥ x
- y ≤ x + 3
Show answer
Answer: B. Trousers ≥ shirts + 3, so y ≥ x + 3. Check: 5 shirts need at least 8 trousers, and 8 ≥ 5 + 3 is true while 7 ≥ 8 is false. y + 3 ≥ x would allow fewer trousers than shirts.
-
10. Solve the fertiliser problem: minimise Z = 200x + 150y subject to 3x + y ≥ 12, x + y ≤ 10, x ≥ 0, y ≥ 0. What is the minimum cost?
- ₹800
- ₹1550
- ₹1800
- ₹2000
Show answer
Answer: A. Corners: (4, 0), (10, 0) and (1, 9) where 3x + y = 12 meets x + y = 10 (2x = 2). Costs: 800, 2000, 200 + 1350 = 1550. The region is a bounded triangle, so the minimum is ₹800 with 4 bags of P. ₹1800 comes from (0, 12), which breaks x + y ≤ 10.
-
11. What is the maximum of Z = 3x + 5y subject to x + 3y ≤ 15, 2x + y ≤ 10, x ≥ 0, y ≥ 0?
- 25
- 29
- 30
- 15
Show answer
Answer: B. The lines meet where x = 15 − 3y and 2(15 − 3y) + y = 10, so y = 4, x = 3. Corners (0, 0), (5, 0), (3, 4), (0, 5) give Z = 0, 15, 29, 25. Maximum 29 at (3, 4).
-
12. What is the minimum of Z = 2x − 3y subject to x + y ≤ 8, x − y ≤ 4, x ≥ 2, y ≥ 1?
- 0
- 1
- 7
- −14
Show answer
Answer: D. Corners: (2, 1), (2, 6) from x = 2 and x + y = 8, (6, 2) from x + y = 8 and x − y = 4, and (5, 1) from x − y = 4 and y = 1. Z = 1, 4 − 18 = −14, 6, 7. The minimum is −14 at (2, 6). The origin is not feasible, so 0 is not possible.
-
13. What is the minimum of Z = 5x + 2y subject to 2x + y ≥ 8, x + 2y ≥ 7, x ≥ 0, y ≥ 0?
- 19
- 35
- 16
- No minimum exists
Show answer
Answer: C. Corners: (0, 8), (3, 2) and (7, 0), giving 16, 19, 35. The region is unbounded, so test 5x + 2y < 16: since 5x + 2y = 2(2x + y) + x ≥ 16 + 0, no feasible point does better. The minimum is 16 at (0, 8).
-
14. On the same region (2x + y ≥ 8, x + 2y ≥ 7, x ≥ 0, y ≥ 0), which statement about Z = 3x − y is true?
- The minimum is −8
- The maximum is 21
- The minimum is −8 and there is no maximum
- Z has neither a maximum nor a minimum
Show answer
Answer: D. Corner values: (0, 8) gives −8, (3, 2) gives 7, (7, 0) gives 21. Test the minimum: (0, 9) is feasible and gives −9 < −8, so no minimum. Test the maximum: (8, 0) is feasible and gives 24 > 21, so no maximum either.
-
15. A bounded feasible region has corners (0, 0), (0, 4), (3, 3) and (5, 0). Z = px + qy with p, q > 0 has its maximum at both (3, 3) and (5, 0). What is the relation between p and q?
- 3p = 2q
- 2p = 3q
- p = q
- p = 5q
Show answer
Answer: B. A tie at the two corners: 3p + 3q = 5p, so 3q = 2p. Check with p = 3, q = 2: Z = 0, 8, 15, 15, so (3, 3) and (5, 0) do tie for the largest value, and every point of the edge between them is optimal.
Questions 1-3: lesson 1 (inequalities and half-planes). Questions 4-6: lesson 2 (feasible regions and corner points). Questions 7-9: lesson 3 (formulating an LPP). Questions 10-12: lesson 4 (the corner-point method). Questions 13-15: lesson 5 (unbounded regions and multiple optima). Revisit the lesson for any question you got wrong.
Sign in to keep track of the lessons you finish.