Miscellaneous Exercise 6 – Revision of linear programmingClass 12 Commerce Maths · Chapter 6 Linear Programming · Miscellaneous Exercise 6 – Maharashtra Board

Textbook: Mathematics and Statistics (Commerce) Part II – Class 12 (Balbharati, official free PDF) · pages 95–107

This exercise revises all of Chapter 6 on linear programming. The objective questions test where the optimum lies, what a feasible region is and how to read half-planes and word constraints. The problems then ask you to solve LPPs graphically, including cases with infinitely many optimal solutions, and to formulate and solve full business problems about chairs and tables, bicycles, chemicals, gift items and electrical goods. Work every graph neatly — the corner-point table is where the marks are.

🎧 Listen to the summary

Summary: Miscellaneous Exercise 6 – Revision of linear programming

An LPP optimises a linear objective subject to linear constraints; its feasible region is convex.

The optimum, when it exists, is at a vertex of the feasible region; if two vertices tie, every point between them is optimal.

Word constraints: 'more women than men' → y > x; 'at least twice as many y as x' → y ≥ 2x; 'holds up to 40' → x ≤ 40.

x ≥ 0, y ≥ 0 is the first quadrant; y ≤ 0 is the third and fourth quadrants.

Full problems: formulate, draw, list vertices, evaluate z, and state the answer in words.

Key points to remember

  • A point lies in the half-plane ax + by ≤ c if substituting it makes the inequality true.
  • If an LPP has two optimal solutions, it has infinitely many.
  • Not every LPP has an optimal solution (unbounded or empty regions).
  • The objective function is the function to be maximised or minimised.
  • The feasible region is the set of points satisfying all the constraints.
  • An equality constraint (3x + 5y = 15) restricts the solution to a segment of that line.
  • In minimisation with '≥' constraints, check every vertex of the unbounded region.
  • The same data (chairs/tables and mixers/processors) can give the same optimal point with different profits.
  • Always interpret: 'make 3 chairs and 9 tables for a maximum profit of Rs 2,310'.
  • Contradictory constraints such as x + y ≤ 1 and x + y ≥ 3 give no feasible region.
Want a teacher to explain Miscellaneous Exercise 6 – Revision of linear programming?

Get a ✓ Verified tutor for “Miscellaneous Exercise 6 – Revision of linear programming” — 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