TalentJR apps
Textbook: Mathematics I – Class 12 (Balbharati, official free PDF) · pages 232–234
In linear programming the constraints of a problem are linear inequations, and the set of points that satisfies all of them is the feasible region. This exercise asks you to draw such regions for systems with three, four or five inequations, including the non-negativity conditions x ≥ 0, y ≥ 0, and to translate two short business situations into inequations. The key skill is finding the corner points (vertices) of the region, because in the next exercise the optimum of a linear objective function will always be found at one of them. Each solution below lists the boundary lines, the side shaded and the vertices of the feasible region.
The feasible region is the intersection of all the half-planes given by the constraints.
With x ≥ 0 and y ≥ 0 the region lies in the first quadrant.
Corner points are found by solving pairs of boundary equations and keeping only the points that satisfy every constraint.
A feasible region may be bounded (a polygon) or unbounded; a constraint can also be redundant (it does not change the region).
In word problems, each limited resource (time, material, money, space) gives one ≤ constraint.
Get a ✓ Verified tutor for “Exercise 7.2 – Feasible regions of systems of inequations and simple word problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Vertices of x + y ≤ 5, x + 3y ≤ 9, x ≥ 0, y ≥ 0.
Answer: O, (5, 0), (3, 2), (0, 3)
Describe the region x + y ≥ 4, x ≥ 0, y ≥ 0.
Answer: Unbounded, with corners (4, 0) and (0, 4)
Is 2x + y ≤ 10 redundant with x + y ≤ 4, x, y ≥ 0?
Answer: Yes, it is redundant
Each chair needs 2 h of carpentry and each table 5 h; 40 h are available. Write the constraint.
Answer: 2x + 5y ≤ 40, x ≥ 0, y ≥ 0
| What | Formula | Symbols |
|---|---|---|
| Feasible region | Intersection of all constraint half-planes | |
| Vertex | Solve two boundary equations, check the rest | 3x + 2y = 18, 2x + y = 10 → (2, 6) |
| Resource constraint | a₁x + a₂y ≤ available | 3x + 2y ≤ 6 (silver) |
| Non-negativity | x ≥ 0, y ≥ 0 | |
| Redundant test | Constraint holds at all vertices without it | 2x + y ≤ 200 with x + y ≤ 60 |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1. Feasible region of 3x + 2y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0.
Answer: Quadrilateral with vertices O(0, 0), (5, 0), (2, 6), (0, 9)
2. Q2. Feasible region of 2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0.
Answer: Triangle with vertices (2, 0), (3, 0), (0, 2)
3. Q3. Feasible region of 3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0.
Answer: Quadrilateral with vertices (0, 3), (8/3, 1), (21/4, 1), (0, 4)
4. Q4. Feasible region of x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Answer: Pentagon with vertices O(0, 0), (7, 0), (6, 3), (4, 5), (0, 6)
5. Q5. Feasible region of 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≤ 5, 2x + y ≥ 4.
Answer: Pentagon with vertices (2, 0), (3, 0), (3, 2), (2, 3), (1/2, 3)
6. Q6. Feasible region of x − 2y ≤ 2, x + y ≥ 3, −2x + y ≤ 4, x ≥ 0, y ≥ 0.
Answer: Unbounded region with corners (0, 4), (0, 3), (8/3, 1/3)
7. Q7. Article A needs 3 g silver and 1 g gold; B needs 2 g silver and 2 g gold; 6 g silver and 4 g gold are available. Write the inequations and find the feasible region.
Answer: 3x + 2y ≤ 6, x + 2y ≤ 4, x, y ≥ 0; region O, (2, 0), (1, 3/2), (0, 2)
8. Q8. A dealer has Rs 1,50,000 and space for at most 60 pieces; a table costs Rs 1500 and a chair Rs 750. Write the inequations and the feasible region.
Answer: 2x + y ≤ 200, x + y ≤ 60, x, y ≥ 0; region is the triangle O, (60, 0), (0, 60)
Read the question, answer it in your head, then tap the card to check. 20 cards.
15 questions. Tap an option — you will see at once if it is right and why.
1. The feasible region is
Answer: B. Definition.
2. 3x + 2y = 18 and 2x + y = 10 meet at
Answer: C. y = 10 − 2x.
3. The vertices of 2x + 3y ≤ 6, x + y ≥ 2, x, y ≥ 0 are
Answer: D. The triangle between the two lines.
4. x + 4y = 24 and x + y = 9 meet at
Answer: A. 3y = 15.
5. 3x + y = 21 and x + y = 9 meet at
Answer: D. 2x = 12.
6. In Q5, the line 2x + y = 4 meets y = 3 at
Answer: C. 2x = 1.
7. The silver and gold constraints of Q7 meet at
Answer: A. Subtract the equations.
8. In Q8, the money constraint is
Answer: D. Divide by 750.
9. A constraint that does not change the region is
Answer: A. Definition.
10. The region x + y ≥ 4, x ≥ 0, y ≥ 0 is
Answer: D. It extends without limit.
11. The region in Q6 has a corner at
Answer: D. x + y = 3 meets x − 2y = 2.
12. Vertices must satisfy
Answer: B. They belong to the region.
13. In Q3, the corner on y = 1 of 3x + 4y = 12 is
Answer: C. 3x = 8.
14. Which point is feasible for 3x + 2y ≤ 18, 2x + y ≤ 10, x, y ≥ 0?
Answer: B. 16 ≤ 18 and 9 ≤ 10.
15. The variables in a word problem are usually
Answer: A. They count quantities.
Get a ✓ Verified tutor for “Exercise 7.2 – Feasible regions of systems of inequations and simple word problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 7.2 – Feasible regions of systems of inequations and simple word problems the fun way: match key terms, beat the 60-second lightning round and spot true or false facts. Every game uses only this lesson, so each round is real exam revision.
⭐ 0 XP⏱ About 40 minutes
Get a ✓ Verified tutor for “Exercise 7.2 – Feasible regions of systems of inequations and simple word problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Sign in free to see the answers to the textbook exercise of Exercise 7.2 – Feasible regions of systems of inequations and simple word problems.
Sign in to see solutionsStuck on a question? Type it, 🎤 speak it or 📷 snap a photo of it and get simple, step-by-step help with “Linear Programming Ex 7.2” — important questions, a quick quiz, revision notes — in English, मराठी or हिंदी.
Sign in with Google to ask the AI tutor. It's free — 20 questions a day, one TalentJR account.
Sign in to askPrefer a real teacher? TalentJR teachers take live online classes anywhere in India. Tell us what you need and our team will call you with timings and fees.