Exercise 6.2 – Solving an LPP graphically by the corner-point methodClass 12 Commerce Maths · Chapter 6 Linear Programming · Exercise 6.2 – Maharashtra Board

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.

🎧 Listen to the summary

Summary: Exercise 6.2 – Solving an LPP graphically by the corner-point method

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.

Key points to remember

  • Draw each line ax + by = c using its intercepts (c/a, 0) and (0, c/b).
  • Test the origin: if (0, 0) satisfies the inequality, shade the origin side; otherwise the other side.
  • '≤' constraints usually give the origin side; '≥' constraints the non-origin side.
  • Vertices lie on the axes or where two boundary lines meet — solve those two equations together.
  • Include only intersection points that satisfy every constraint.
  • For maximisation over a bounded region, the answer is the vertex with the largest z.
  • For minimisation with '≥' constraints the region is usually unbounded, but a minimum still exists at a vertex.
  • A set is convex if the segment joining any two of its points lies inside it.
  • If z is parallel to a boundary edge, there can be infinitely many optimal points.
  • State the final answer as 'z is maximum (or minimum) = … at x = …, y = …'.
Want a teacher to explain Exercise 6.2 – Solving an LPP graphically by the corner-point method?

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.

Get a tutor for this chapter →

👩‍🏫 Class 12 Commerce Maths Book classes — live online, request a call back

Prefer 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.

Live online classesSmall groups or 1:1 with a teacher, from home, any city.
We call you backOur team asks what your child needs, then shares timings and fees.
Home tutor?We are still building our list of home tutors — ask on the call if there is one near you.

Keep learning