TalentJR apps
Textbook: Mathematics I – Class 12 (Balbharati, official free PDF) · pages 238–241
The corner point theorem makes linear programming in two variables simple: if a linear objective function z = ax + by has an optimum over a feasible region, the optimum occurs at a vertex (corner point) of that region. So the method is to draw the feasible region, list its vertices, evaluate z at each, and pick the largest (for maximisation) or the smallest (for minimisation). When two adjacent vertices give the same best value, every point of the edge joining them is optimal. This exercise solves eight LPPs this way; one printed answer (Q8) does not match the printed objective and is explained.
Corner point method: draw the feasible region, find all vertices, evaluate z at each, choose the best.
For a bounded region both a maximum and a minimum exist; for an unbounded region one of them may not.
If two adjacent vertices give the same optimum, every point on the edge between them is optimal.
Vertices come from intercepts of boundary lines and from solving pairs of boundary equations.
The objective's level lines ax + by = k are parallel; the optimum is where the last such line touches the region.
Get a ✓ Verified tutor for “Exercise 7.4 – Solving LPPs graphically by the corner point method” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Maximise z = 3x + 2y s.t. x + y ≤ 4, x ≤ 3, x, y ≥ 0.
Answer: Maximum 11 at (3, 1)
Minimise z = 2x + 3y s.t. x + y ≥ 3, x, y ≥ 0.
Answer: Minimum 6 at (3, 0)
Maximise z = 2x + 4y s.t. x + 2y ≤ 8, x ≤ 6, x, y ≥ 0.
Answer: Maximum 16 at every point of the segment from (6, 1) to (0, 4)
For z = x + y on the square 0 ≤ x, y ≤ 2, where is z largest?
Answer: Maximum 4 at (2, 2)
| What | Formula | Symbols |
|---|---|---|
| Corner point theorem | Optimum of z = ax + by is at a vertex | |
| Vertex | Solve two boundary equations | 3x + 5y = 26, 5x + 3y = 30 → (4.5, 2.5) |
| Tie | Equal z at adjacent vertices ⇒ whole edge optimal | Q8 as printed |
| Value table | List (vertex, z) | Q1: max 60 at (4, 2) |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1. Maximise z = 11x + 8y s.t. x ≤ 4, y ≤ 6, x + y ≤ 6, x, y ≥ 0.
Answer: Maximum z = 60 at (4, 2)
2. Q2. Maximise z = 4x + 6y s.t. 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Answer: Maximum z = 36 at (0, 6)
3. Q3. Maximise z = 7x + 11y s.t. 3x + 5y ≤ 26, 5x + 3y ≤ 30, x, y ≥ 0.
Answer: Maximum z = 59 at (4.5, 2.5)
4. Q4. Maximise z = 10x + 25y s.t. 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≤ 5.
Answer: Maximum z = 95 at (2, 3)
5. Q5. Maximise z = 3x + 5y s.t. x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x, y ≥ 0.
Answer: Maximum z = 37 at (4, 5)
6. Q6. Minimise z = 7x + y s.t. 5x + y ≥ 5, x + y ≥ 3, x, y ≥ 0.
Answer: Minimum z = 5 at (0, 5)
7. Q7. Minimise z = 8x + 10y s.t. 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x ≥ 0.
Answer: Minimum z = 52 at (1.5, 4)
8. Q8. Minimise z = 6x + 2y s.t. x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x, y ≥ 0.
Answer: Minimum z = 6 at every point of the segment from (0, 3) to (3/5, 6/5)
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 optimum of z = ax + by on a bounded region occurs
Answer: B. Corner point theorem.
2. Q1: max of 11x + 8y with x ≤ 4, y ≤ 6, x + y ≤ 6 is
Answer: B. At (4, 2).
3. Q2: max of 4x + 6y with 3x + 2y ≤ 12, x + y ≥ 4 is
Answer: B. At (0, 6).
4. Q3: max of 7x + 11y with 3x + 5y ≤ 26, 5x + 3y ≤ 30 is
Answer: B. At (4.5, 2.5).
5. Q4: max of 10x + 25y with x ≤ 3, y ≤ 3, x + y ≤ 5 is
Answer: A. At (2, 3).
6. Q5: max of 3x + 5y is
Answer: B. Compare the vertices.
7. Q6: min of 7x + y with 5x + y ≥ 5, x + y ≥ 3 is
Answer: D. Smallest vertex value.
8. Q7: min of 8x + 10y is
Answer: D. Compare vertices.
9. If two adjacent vertices give the same maximum,
Answer: C. Multiple optima.
10. For a minimisation with ≥ constraints, the feasible region is usually
Answer: C. It extends away from O.
11. Q8 as printed (min 6x + 2y) has its minimum
Answer: B. 6x + 2y = 2(3x + y).
12. The intersection of 3x + 5y = 26 and 5x + 3y = 30 is
Answer: D. Solve the pair.
13. Level lines of z = 3x + 2y have slope
Answer: B. y = −(3/2)x + k/2.
14. Max of x + y on 0 ≤ x, y ≤ 2 is
Answer: C. At (2, 2).
15. In Q4, the vertex (3, 2) gives z =
Answer: D. 30 + 50.
Get a ✓ Verified tutor for “Exercise 7.4 – Solving LPPs graphically by the corner point method” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 7.4 – Solving LPPs graphically by the corner point method 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 45 minutes
Get a ✓ Verified tutor for “Exercise 7.4 – Solving LPPs graphically by the corner point method” — 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.4 – Solving LPPs graphically by the corner point method.
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.4” — 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.