TalentJR apps
Textbook: Mathematics I – Class 12 (Balbharati, official free PDF) · pages 241–245
This last set of the book revises the whole Linear Programming chapter: fifteen MCQs, graphs of single inequations and systems, LPPs to solve by the corner point method, and eight full word problems to formulate and solve. Several printed LPPs ask to maximise over an unbounded region, where no maximum exists; the solutions say so clearly and give the minimum that the book's answer actually reports. The MCQ key for Q1 is also corrected.
A linear inequation describes a half-plane; a system describes the intersection of half-planes (the feasible region).
The optimum of z = ax + by over a feasible region is at a vertex; ties along an edge give infinitely many optima.
Over an unbounded region a maximum (or minimum) may fail to exist.
Word problems: define x, y; write the objective; write one constraint per resource or requirement; add x, y ≥ 0.
Always finish with the optimal point, the optimal value and a sentence in the language of the problem.
Get a ✓ Verified tutor for “Miscellaneous Exercise 7 – Revision of linear programming: inequations, feasible regions, LPP models and solutions” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Which point lies in 2x + 5y < 10: (1, 2), (0, 1), (5, 0)?
Answer: (0, 1)
Maximise z = x + y s.t. x + y ≥ 2, x, y ≥ 0.
Answer: No maximum; z is unbounded
Maximise z = 3x + 6y s.t. x + 2y ≤ 8, x, y ≥ 0.
Answer: Maximum 24 on the whole segment from (8, 0) to (0, 4)
Toys A (profit Rs 5) and B (Rs 4): A needs 1 h, B 2 h of a machine (12 h available); at most 8 toys in all. Solve.
Answer: Make 8 of A and none of B; maximum profit Rs 40
| What | Formula | Symbols |
|---|---|---|
| Corner point theorem | Optimum at a vertex | |
| Half-plane test | Substitute a point | 3x + 2y < 8 contains (0, 0) |
| Resource | Σ use ≤ available | 3x + 3y ≤ 36 |
| Requirement | Σ content ≥ needed | x + 2y ≥ 80 |
| Unbounded | ≥ constraints only ⇒ no maximum | II 5 (ii) |
Solve each one in your notebook first. Then open the solution and compare every step.
1. I (1)–(8). MCQs: (1) where the maximum occurs (2) which statement is correct (3) objective function (4) max of 5x + 3y with 3x + 5y ≤ 15, 5x + 2y ≤ 10 (5) max of 10x + 6y with 3x + y ≤ 12, 2x + 5y ≤ 34 (6) point maximising x + y with x + 2y ≤ 70, 2x + y ≤ 95 (7) the optimal point lies (8) feasible region.
Answer: (1) C (2) C (3) B (4) C (5) A (6) D (7) C (8) B
2. I (9)–(15). (9) min 2x + 3y with 1 ≤ x + 2y ≤ 10 (10) corners of x + y ≤ 4, 2x + y ≤ 7 (11) max of 7x + y at given corners (12) max of 4x + 5y at given corners (13) min of 3x + 2y at given corners (14) point in 3x + 2y < 8 (15) point in 4x + 3y > 14.
Answer: (9) A (10) B (11) B (12) B (13) A (14) C (15) C
3. II 1–2. Solve graphically: 1 (i) 4x − 18 ≥ 0 (ii) −11x − 55 ≤ 0 (iii) 5y − 12 ≥ 0 (iv) y ≤ −3.5; 2 (i) x ≥ 5y (ii) x + y ≤ 0 (iii) 2y − 5x ≥ 0 (iv) x + 51 ≤ y (as printed).
Answer: Half-planes as described
4. II 3–4. (3) (i) 2x + y ≥ 2, x − y ≤ 1 (ii) x + 2y ≥ 4, 2x − y ≤ 6 (iii) 3x + 4y ≤ 12, x − 2y ≥ 2, y ≥ −1. (4) Feasible regions (i) 2x + 3y ≤ 12, 2x + y ≤ 8, x, y ≥ 0 (ii) 3x + 4y ≥ 12, 4x + 7y ≤ 28, x, y ≥ 0.
Answer: Regions as described
5. II 5. Solve (i) max z = 5x₁ + 6x₂ s.t. 2x₁ + 3x₂ ≤ 18, 2x₁ + x₂ ≤ 12 (ii) max z = 4x + 2y s.t. 3x + y ≥ 27, x + y ≥ 21 (iii) max z = 6x + 10y s.t. 3x + 5y ≤ 10, 5x + 3y ≤ 15 (iv) max z = 2x + 3y s.t. x − y ≥ 3 (all with non-negative variables).
Answer: (i) 40.5 at (4.5, 3) (ii) no maximum (min 48 at (3, 18)) (iii) 20 on a whole edge (iv) no maximum
6. II 6. Solve (i) max z = 4x₁ + 3x₂ s.t. 3x₁ + x₂ ≤ 15, 3x₁ + 4x₂ ≤ 24 (ii) max z = 60x + 50y s.t. x + 2y ≤ 40, 3x + 2y ≤ 60 (iii) max z = 4x + 2y s.t. 3x + y ≥ 27, x + y ≥ 21, x + 2y ≥ 30.
Answer: (i) 25 at (4, 3) (ii) 1350 at (10, 15) (iii) no maximum (min 48 at (3, 18))
7. II 7. Chairs (profit Rs 140) and tables (Rs 210) need assembling 3, 3 h (36), finishing 5, 2 h (50), polishing 2, 6 h (60). Formulate and solve.
Answer: 3 chairs and 9 tables; maximum profit Rs 2310
8. II 8. Bicycles need 6 h on A and 3 h on B; tricycles 4 h on A and 10 h on B; A has 120 h, B 180 h; profits Rs 180 and Rs 220. Solve.
Answer: 10 bicycles and 15 tricycles; maximum profit Rs 5100
9. II 9. Chemicals A, B need P: 1, 2 (at least 80) and Q: 3, 1 (at least 75); costs Rs 4, Rs 6 per kg. Minimise cost.
Answer: 14 units of A and 33 of B; minimum cost Rs 254
10. II 10. Mixers (profit Rs 2000) and food processors (Rs 3000) use machines A, B, C: 3, 3 (36), 5, 2 (50), 2, 6 (60) hours. Maximise profit.
Answer: 3 mixers and 9 food processors; maximum profit Rs 33000
11. II 11. Compound I has 4, 12, 2 litres of A, B, C; compound II has 2, 2, 6; needs at least 16, 24, 18; costs Rs 800 and Rs 640. Minimise cost.
Answer: 3 units of I and 2 of II; minimum cost Rs 3680
12. II 12. Gift A needs 4 h cutting and 2 h finishing; B needs 2 h and 4 h; 208 and 152 h available; profits Rs 75 and Rs 125. Maximise.
Answer: 44 of A and 16 of B; maximum profit Rs 5300
13. II 13–14. (13) Products A, B (profit Rs 3, Rs 4) need 1, 1 min on M1 (450 min) and 2, 1 min on M2 (600 min). (14) Items A, B (profit Rs 20, Rs 30) need 3, 2 motors (210) and 2, 4 transformers (300).
Answer: (13) 450 of B only, Rs 1800 (14) 30 of A and 60 of B, Rs 2400
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 objective function under linear constraints is maximum
Answer: A. Corner point theorem.
2. If an LPP has two optimal solutions, it has
Answer: A. The whole edge is optimal.
3. The objective function of an LPP is
Answer: D. Definition.
4. Max of z = 5x + 3y s.t. 3x + 5y ≤ 15, 5x + 2y ≤ 10, x, y ≥ 0 is
Answer: A. At (20/19, 45/19).
5. Max of z = 10x + 6y s.t. 3x + y ≤ 12, 2x + 5y ≤ 34 is
Answer: B. At (2, 6).
6. Max of x + y s.t. x + 2y ≤ 70, 2x + y ≤ 95 is at
Answer: A. Value 55.
7. Feasible region is the set of points satisfying
Answer: A. Definition.
8. Min of 2x + 3y s.t. 1 ≤ x + 2y ≤ 10, x, y ≥ 0 is at
Answer: D. Value 3/2.
9. Corner points of x + y ≤ 4, 2x + y ≤ 7, x, y ≥ 0 are
Answer: A. 2x + y = 7 cuts the x-axis first.
10. With corners (0, 0), (2, 0), (12/7, 3/7), (0, 1), z = 7x + y is maximum at
Answer: B. 14 is largest.
11. With corners (0, 0), (3, 0), (2, 1), (0, 7/3), max of 4x + 5y is
Answer: C. At (2, 1).
12. With corners (0, 10), (2, 2), (4, 0), min of 3x + 2y is at
Answer: B. Value 10.
13. 3x + 2y < 8 contains
Answer: A. 0 < 8.
14. 4x + 3y > 14 contains
Answer: B. 24 > 14.
15. Maximise z = 4x + 2y s.t. 3x + y ≥ 27, x + y ≥ 21 has
Answer: C. All constraints are ≥.
Get a ✓ Verified tutor for “Miscellaneous Exercise 7 – Revision of linear programming: inequations, feasible regions, LPP models and solutions” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Miscellaneous Exercise 7 – Revision of linear programming: inequations, feasible regions, LPP models and solutions 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 90 minutes
Get a ✓ Verified tutor for “Miscellaneous Exercise 7 – Revision of linear programming: inequations, feasible regions, LPP models and solutions” — 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 7 – Revision of linear programming: inequations, feasible regions, LPP models and solutions.
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 7” — 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.