TalentJR apps
Textbook: Mathematics I – Class 12 (Balbharati, official free PDF) · pages 234–238
Before a linear programming problem (L.P.P.) can be solved it must be written in mathematical form: decision variables, an objective function to maximise or minimise, and the constraints. This exercise is entirely about that translation. The reliable method is to put the data in a table (products as columns, resources or nutrients as rows), read one constraint from each row, and read the objective from the profit or cost row. Limited resources give ≤ constraints; minimum requirements give ≥ constraints; and counts or amounts are never negative.
An L.P.P. has decision variables (x, y), a linear objective function z = ax + by and linear constraints, plus x ≥ 0, y ≥ 0.
Maximise for profit, revenue or distance; minimise for cost or time.
A resource that is available up to a limit gives (use per unit of x)·x + (use per unit of y)·y ≤ limit.
A requirement that must be met gives (supply per unit of x)·x + (supply per unit of y)·y ≥ requirement.
Always state clearly what x and y stand for, with units.
Get a ✓ Verified tutor for “Exercise 7.3 – Formulating linear programming problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
A baker makes cakes (profit Rs 40) and pies (profit Rs 30). A cake needs 2 kg flour and a pie 1 kg; 50 kg flour is available. Formulate.
Answer: Maximise z = 40x + 30y s.t. 2x + y ≤ 50, x, y ≥ 0
Product A needs 3 h on a lathe, B needs 4 h; the lathe runs at most 48 h a week.
Answer: 3x + 4y ≤ 48
Food P has 3 units of vitamin and food Q has 2; at least 12 units are needed. P costs Rs 5, Q Rs 4 per unit. Formulate.
Answer: Minimise C = 5x + 4y s.t. 3x + 2y ≥ 12, x, y ≥ 0
A car uses Rs 6/km at 40 km/h and Rs 9/km at 80 km/h; Rs 720 and 2 hours are available. Maximise distance.
Answer: Maximise D = x + y s.t. x/40 + y/80 ≤ 2, 6x + 9y ≤ 720, x, y ≥ 0
| What | Formula | Symbols |
|---|---|---|
| Objective | z = (profit per unit)·x + (profit per unit)·y | |
| Resource | Σ (use per unit)·(units) ≤ available | 10x + 6y ≤ 60 |
| Requirement | Σ (content per unit)·(units) ≥ needed | 2x + y ≥ 14 |
| Time from distance | time = distance/speed | x/60 + y/90 ≤ 1 |
| Non-negativity | x ≥ 0, y ≥ 0 |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1. Gadgets A, B: foundry hours 10 and 6 (60 available), machine-shop hours 5 and 4 (35 available); profits Rs 30, Rs 20. Formulate.
Answer: Maximise z = 30x + 20y s.t. 10x + 6y ≤ 60, 5x + 4y ≤ 35, x, y ≥ 0
2. Q2. Ration needs at least 14, 22, 1 units of nutrients A, B, C; fodder 1 has 2, 2, 1 and fodder 2 has 1, 3, 1 units; costs Rs 3 and Rs 2. Formulate to minimise cost.
Answer: Minimise C = 3x + 2y s.t. 2x + y ≥ 14, 2x + 3y ≥ 22, x + y ≥ 1, x, y ≥ 0
3. Q3. Chemicals A, B need raw material P: 3, 2 units (120 available) and Q: 2, 5 units (160 available); profits Rs 350, Rs 400. Formulate.
Answer: Maximise p = 350x + 400y s.t. 3x + 2y ≤ 120, 2x + 5y ≤ 160, x, y ≥ 0
4. Q4. Magazines A, B earn Rs 10, Rs 15; A needs 2, 5, 2 h and B needs 3, 2, 6 h on machines I, II, III, available 36, 50, 60 h. Formulate.
Answer: Maximise z = 10x + 15y s.t. 2x + 3y ≤ 36, 5x + 2y ≤ 50, 2x + 6y ≤ 60, x, y ≥ 0
5. Q5. Bulbs need 1 h on M1 and 3 h on M2; tubes 2 h and 4 h; M1 at most 10 h, M2 at most 12 h a day; profits Rs 13.5 and Rs 55 per package. Formulate.
Answer: Maximise z = 13.5x + 55y s.t. x + 2y ≤ 10, 3x + 4y ≤ 12, x, y ≥ 0
6. Q6. Fertilisers F1, F2 need raw material A: 2, 3 (40 available) and B: 1, 4 (70 available); profits Rs 500, Rs 750. Formulate.
Answer: Maximise z = 500x + 750y s.t. 2x + 3y ≤ 40, x + 4y ≤ 70, x, y ≥ 0
7. Q7. Diet needs at least 18 fat, 28 carbohydrate, 14 protein units; food A has 4, 14, 8 and food B has 6, 12, 8 units; prices Rs 4.5 and Rs 3.5. Formulate to minimise cost.
Answer: Minimise C = 4.5x + 3.5y s.t. 4x + 6y ≥ 18, 14x + 12y ≥ 28, 8x + 8y ≥ 14, x, y ≥ 0
8. Q8. At 60 km/h petrol costs Rs 5/km; at 90 km/h Rs 8/km. John has Rs 600 and wants the maximum distance within one hour. Formulate.
Answer: Maximise z = x₁ + x₂ s.t. x₁/60 + x₂/90 ≤ 1, 5x₁ + 8x₂ ≤ 600, x₁, x₂ ≥ 0
9. Q9. A brick must weigh at least 5 kg, with at least 4 kg cement and not more than 2 kg sand; cement costs Rs 20/kg, sand Rs 6/kg. Formulate to minimise cost.
Answer: Minimise C = 20x₁ + 6x₂ s.t. x₁ + x₂ ≥ 5, x₁ ≥ 4, x₂ ≤ 2, x₁, x₂ ≥ 0
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. In an L.P.P., the function to be optimised is the
Answer: C. Definition.
2. A machine available for at most 35 hours gives a constraint of type
Answer: B. Limited resource.
3. A diet needing at least 22 units of a nutrient gives
Answer: B. Requirement.
4. The gadget problem objective is
Answer: A. Profit Rs 30 and Rs 20.
5. Foundry constraint for the gadgets is
Answer: B. Foundry hours per unit.
6. The cattle problem should
Answer: B. It asks for the cheapest ration.
7. Chemicals: raw material Q gives
Answer: D. Row Q of the table.
8. Magazine profit function is
Answer: C. Rs 10 and Rs 15 per copy.
9. Bulbs and tubes, machine M1:
Answer: C. 1 h and 2 h.
10. In the diet problem, protein requirement is
Answer: B. Each food has 8 units of protein.
11. John's time constraint is
Answer: A. time = distance/speed.
12. 'Not more than 2 kg of sand' is
Answer: A. At most 2.
13. Fertiliser F1, F2 profit function is
Answer: A. Rs 500 and Rs 750.
14. Non-negativity constraints are
Answer: B. Counts cannot be negative.
15. The bricks problem minimises
Answer: C. Cement Rs 20, sand Rs 6 per kg.
Get a ✓ Verified tutor for “Exercise 7.3 – Formulating linear programming problems” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 7.3 – Formulating linear programming problems 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 40 minutes
Get a ✓ Verified tutor for “Exercise 7.3 – Formulating linear programming problems” — 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 7.3 – Formulating linear programming problems.
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 7.3” — 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.