TalentJR apps
Textbook: Mathematics and Statistics (Commerce) Part II – Class 12 (Balbharati, official free PDF) · pages 99–102
Once a linear programming problem is written down, it can be solved on a graph when there are two variables. Each constraint is a half-plane; their common part is the feasible region, and a key theorem says the best value of the objective always occurs at a corner of that region. This exercise practises the corner-point method: draw the lines, shade the feasible region, find its vertices, and compare the value of z at each one.
Each linear inequality represents a half-plane; the feasible region is the part common to all constraints including x ≥ 0, y ≥ 0.
The feasible region of an LPP is a convex set.
The optimum value of z (maximum or minimum) occurs at a corner (vertex) of the feasible region.
Corner-point method: find all vertices, evaluate z at each, and pick the largest (max) or smallest (min).
If two adjacent vertices give the same optimum, every point on the edge joining them is optimal; if the region is unbounded, a maximum may not exist.
Get a ✓ Verified tutor for “Exercise 6.2 – Solving an LPP graphically by the corner-point method” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Which side of 2x + 3y = 12 represents 2x + 3y ≥ 12?
Answer: The non-origin side
Maximise z = 3x + 5y subject to x + y ≤ 6, x + 2y ≤ 8, x, y ≥ 0.
Answer: Maximum z = 22 at x = 4, y = 2
Minimise z = 4x + 3y subject to x + y ≥ 5, x + 3y ≥ 9, x, y ≥ 0.
Answer: Minimum z = 15 at x = 0, y = 5
Minimise z = 2x + 2y subject to x + y ≥ 4, x + 3y ≥ 6, x, y ≥ 0.
Answer: Minimum 8 at infinitely many points
| What | Formula | Symbols |
|---|---|---|
| Intercepts | ax + by = c meets the axes at (c/a, 0) and (0, c/b) | x + 2y = 8 → (8, 0), (0, 4) |
| Origin test | 0 ≤ c true → origin side | x + y ≤ 6: 0 ≤ 6 true |
| Vertex | solve the two boundary equations together | x + y = 6, x + 2y = 8 → (4, 2) |
| Corner-point rule | optimum of z = ax + by is at a vertex | z(B) = 22 is the maximum |
| Multiple optima | two vertices with equal best z → the whole edge | z = 2x + 2y on x + y = 4 |
| Unbounded region | a maximum may not exist | Region extends to infinity |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1. Maximise z = 11x + 8y subject to x ≤ 4, y ≤ 6, x + y ≤ 6, x, y ≥ 0.
Answer: Max z = 60 at x = 4, y = 2
2. Q2. Maximise z = 4x + 6y subject to 3x + 2y ≤ 12, x + y ≥ 4, x, y ≥ 0.
Answer: Max z = 36 at x = 0, y = 6
3. Q3. Maximise z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x, y ≥ 0.
Answer: Max z = 59 at x = 4.5, y = 2.5
4. Q4. Maximise z = 10x + 25y subject to 0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≤ 5.
Answer: Max z = 95 at x = 2, y = 3
5. Q5. Maximise z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x, y ≥ 0.
Answer: Max z = 37 at x = 4, y = 5
6. Q6. Minimise z = 7x + y subject to 5x + y ≥ 5, x + y ≥ 3, x, y ≥ 0.
Answer: Min z = 5 at x = 0, y = 5
7. Q7. Minimise z = 8x + 10y subject to 2x + y ≥ 7, 2x + 3y ≥ 15, y ≥ 2, x, y ≥ 0.
Answer: Min z = 52 at x = 1.5, y = 4
8. Q8. Minimise z = 6x + 2y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x, y ≥ 0.
Answer: Min z = 6 at every point of the segment from (0.6, 1.2) to (0, 3), e.g. x = 0, y = 3
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 value of an LPP occurs
Answer: A. Corner-point theorem.
2. For x + y ≤ 6, the feasible side is
Answer: A. 0 ≤ 6 is true.
3. Intercepts of 2x + 3y = 18 are
Answer: C. 18/2 and 18/3.
4. Lines 2x + 3y = 18 and 2x + y = 10 meet at
Answer: A. Subtract: 2y = 8.
5. Max z = 9x + 13y at O(0,0), A(5,0), B(3,4), C(0,6) is
Answer: D. 27 + 52 at B.
6. The feasible region of an LPP is always
Answer: A. Theorem 1.
7. Min z = 5x + 2y over vertices (6, 0), (1, 5), (0, 10) is
Answer: D. 5 + 10 at (1, 5).
8. If z has equal best values at two adjacent vertices, the LPP has
Answer: B. Whole edge is optimal.
9. Max z = 3x + 4y over an unbounded region growing upward has
Answer: A. z keeps increasing.
10. A point satisfying all constraints is a
Answer: C. Definition.
11. Max z = 11x + 8y, x ≤ 4, y ≤ 6, x + y ≤ 6 gives
Answer: D. Compare corners.
12. Min z = 7x + y, 5x + y ≥ 5, x + y ≥ 3 gives
Answer: D. Smallest corner value.
13. Min z = 6x + 2y with 3x + y ≥ 3 among the constraints can tie because
Answer: A. 6x + 2y = 2(3x + y).
14. To shade 5x + y ≥ 10 you take
Answer: C. 0 ≥ 10 is false.
15. A convex set is one where
Answer: A. Definition.
Get a ✓ Verified tutor for “Exercise 6.2 – Solving an LPP 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 6.2 – Solving an LPP 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 50 minutes
Get a ✓ Verified tutor for “Exercise 6.2 – Solving an LPP 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 6.2 – Solving an LPP 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 6.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.