TalentJR apps
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.
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.
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.
A bakery must bake at least 3 times as many buns (y) as cakes (x), and at most 120 items in all. Write the constraints.
Answer: y ≥ 3x, x + y ≤ 120, x, y ≥ 0
Which of (1, 1), (3, 4), (6, 1) lies in 4x + 3y ≥ 24?
Answer: (3, 4) and (6, 1)
A potter makes vases (profit Rs 50) and bowls (profit Rs 40). A vase needs 2 h on the wheel and 1 h in the kiln; a bowl needs 1 h on the wheel and 2 h in the kiln. 16 wheel hours and 14 kiln hours are available. Find the best plan.
Answer: 6 vases and 4 bowls; maximum profit Rs 460
Maximise z = 4x + 8y subject to x + 2y ≤ 8, x ≤ 6, x, y ≥ 0.
Answer: Max z = 32 at infinitely many points on that segment
| What | Formula | Symbols |
|---|---|---|
| Corner-point rule | optimum at a vertex | Max at (6, 4) in the potter example |
| Two-vertex tie | whole edge optimal | z = 4(x + 2y) |
| More y than x | y > x | Women more than men |
| Twice as many | y ≥ 2x | First class at least double |
| Capacity | x ≤ 40 | Dishwasher up to 40 pieces |
| Point test | substitute and check the inequality | (3, 4) in 4x + 3y ≥ 24 |
Solve each one in your notebook first. Then open the solution and compare every step.
1. I. Choose the correct alternative, Q1–8.
Answer: 1 c, 2 c, 3 b, 4 c, 5 a, 6 d, 7 c, 8 b
2. I. Choose the correct alternative, Q9–15.
Answer: 9 a, 10 b, 11 b, 12 b, 13 a, 14 c, 15 c
3. II. Fill in the blanks, Q1–8.
Answer: I; I (book: III); corner; III and IV; y > x; x ≥ 3, y ≥ 2; y ≥ 2x (book: x ≥ 2y); x ≤ 40
4. III. True or False, Q1–7.
Answer: 1 T, 2 F, 3 F, 4 T, 5 T, 6 T, 7 T (book) — second half actually false
5. IV Q1. Maximise z = 5x₁ + 6x₂ subject to 2x₁ + 3x₂ ≤ 18, 2x₁ + x₂ ≤ 12, x₁, x₂ ≥ 0.
Answer: Max z = 40.5 at x₁ = 4.5, x₂ = 3
6. IV Q2. Minimise z = 4x + 2y subject to 3x + y ≥ 27, x + y ≥ 21, x, y ≥ 0.
Answer: Min z = 48 at x = 3, y = 18
7. IV Q3. Maximise z = 6x + 10y subject to 3x + 5y ≤ 10, 5x + 3y ≤ 15, x, y ≥ 0.
Answer: Max z = 20 at infinitely many points on that segment
8. IV Q4. Minimise z = 2x + 3y subject to x − y ≤ 1, x + y ≥ 3, x, y ≥ 0.
Answer: Min z = 7 at x = 2, y = 1
9. IV Q5. Maximise z = 4x₁ + 3x₂ subject to 3x₁ + x₂ ≤ 15, 3x₁ + 4x₂ ≤ 24, x₁, x₂ ≥ 0.
Answer: Max z = 25 at x₁ = 4, x₂ = 3
10. IV Q6. Maximise z = 60x + 50y subject to x + 2y ≤ 40, 3x + 2y ≤ 60, x, y ≥ 0.
Answer: Max z = 1,350 at x = 10, y = 15
11. IV Q7. Minimise z = 4x + 2y subject to 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30, x, y ≥ 0.
Answer: Min z = 48 at x = 3, y = 18
12. IV Q8. Chairs (x, profit Rs 140) and tables (y, profit Rs 210) need assembling 3 and 3 h (36 h), finishing 5 and 2 h (50 h), polishing 2 and 6 h (60 h). Formulate and solve.
Answer: 3 chairs and 9 tables; maximum profit Rs 2,310
13. IV Q9. Bicycles (6 h on A, 3 h on B, profit Rs 180) and tricycles (4 h on A, 10 h on B, profit Rs 220); A has 120 h, B 180 h. Maximise profit.
Answer: 10 bicycles and 15 tricycles; maximum profit Rs 5,100
14. IV Q10. Chemicals A (x) and B (y) cost Rs 4 and Rs 6 per kg; P: 1 and 2 units (at least 80), Q: 3 and 1 units (at least 75). Minimise cost.
Answer: 14 kg of A and 33 kg of B; minimum cost Rs 254
15. IV Q11. Mixers (profit Rs 2,000) and food processors (Rs 3,000) use machines A, B, C for 3 and 3, 5 and 2, 2 and 6 hours; 36, 50, 60 hours available. Maximise profit.
Answer: 3 mixers and 9 processors; maximum profit Rs 33,000
16. IV Q12. Compounds I (Rs 800) and II (Rs 640) contain A 4 and 2, B 12 and 2, C 2 and 6 litres; at least 16, 24, 18 litres are needed. Formulate and minimise cost.
Answer: 3 units of I and 2 of II; minimum cost Rs 3,680
17. IV Q13. Gift items A (cutter 4 h, finisher 2 h, profit Rs 75) and B (2 h, 4 h, Rs 125); 208 and 152 hours available. Best plan?
Answer: 44 of A and 16 of B; maximum profit Rs 5,300
18. IV Q14. Products A (Rs 3; M1 1 min, M2 2 min) and B (Rs 4; 1 min each); M1 450 min, M2 600 min. Maximise profit.
Answer: 0 of A and 450 of B; maximum profit Rs 1,800
19. IV Q15. Items A (3 motors, 2 transformers, Rs 20) and B (2 motors, 4 transformers, Rs 30); 210 motors and 300 transformers. Maximise profit.
Answer: 30 of A and 60 of B; maximum profit Rs 2,400
20. Activity 1. Graph 8x + 5y ≤ 40, 4x + 5y ≤ 40, x, y ≥ 0.
Answer: Triangle with vertices (0, 0), (5, 0), (0, 8)
21. Activity 2. Graph 3x + 5y ≥ 15, 2x + 5y ≤ 15, 2x + 3y ≤ 18, x, y ≥ 0.
Answer: Triangle with vertices (5, 0), (7.5, 0), (0, 3)
22. Activity 3. Shraddha invests at most Rs 25,000, at least Rs 10,000 in certificates (5%) and at least Rs 15,000 in deposits (7%). Formulate.
Answer: Max z = 0.05x₁ + 0.07x₂ with those constraints (z = 1,550)
23. Activity 4. Region O(0, 0), A(5, 0), B(4, 3), C(0, 3); maximise z = 3x + 2y.
Answer: Max z = 18 at x = 4, y = 3
24. Activity 5. Bicycles and tricycles (same data as IV Q9).
Answer: Rs 5,100 with 10 bicycles and 15 tricycles
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. Under linear constraints, the objective is maximised
Answer: D. Corner-point theorem.
2. Which is correct?
Answer: D. Points on the joining segment are also optimal.
3. Max z = 5x + 3y, 3x + 5y = 15, 5x + 2y ≤ 10, x, y ≥ 0 is
Answer: A. At (20/19, 45/19).
4. Max z = 10x + 6y, 3x + y ≤ 12, 2x + 5y ≤ 34 is
Answer: D. At (2, 6).
5. Max of z = x + y with x + 2y ≤ 70, 2x + y ≤ 95 occurs at
Answer: C. Intersection of the two lines.
6. Feasible region is the set of points satisfying
Answer: C. Definition.
7. Min z = 2x + 3y with 1 ≤ x + 2y ≤ 10, x, y ≥ 0 is at
Answer: D. z = 1.5 there.
8. Corners of x + y ≤ 4, 2x + y ≤ 7, x, y ≥ 0 are
Answer: A. (4, 0) breaks 2x + y ≤ 7.
9. Corners (0,0), (3,0), (2,1), (0,7/3). Max of 4x + 5y is
Answer: B. 8 + 5 at (2, 1).
10. Corners (0,10), (2,2), (4,0). Min of 3x + 2y is at
Answer: A. Value 10.
11. 4x + 3y ≥ 24 contains
Answer: C. 12 + 12 = 24.
12. 'A train carries at least twice as many first-class (y) as second-class (x) passengers' is
Answer: A. y is at least double x.
13. y ≤ 0 represents the
Answer: A. Below the x-axis.
14. Min z = 4x + 2y with 3x + y ≥ 27, x + y ≥ 21 is
Answer: C. Smallest corner value.
15. Max z = 6x + 10y with 3x + 5y ≤ 10, 5x + 3y ≤ 15 has
Answer: D. z = 2(3x + 5y).
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.
Done with the notes? Revise Miscellaneous Exercise 6 – Revision of linear programming 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 80 minutes
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.
Sign in free to see the answers to the textbook exercise of Miscellaneous Exercise 6 – Revision of linear programming.
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 Miscellaneous Exercise 6” — 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.