TalentJR apps
Textbook: Mathematics and Statistics (Commerce) Part II – Class 12 (Balbharati, official free PDF) · pages 95–99
Businesses constantly ask 'how much of each product should we make?' when machine hours, raw materials or money are limited. Linear programming answers such questions, but first the story must be turned into mathematics. This exercise is entirely about that translation: choosing the decision variables, writing the objective function to be maximised or minimised, and writing every limit as a linear inequality, together with the non-negativity conditions.
A linear programming problem (LPP) maximises or minimises a linear objective function subject to linear constraints.
Decision variables (x, y) are the quantities you can choose, such as units of each product.
Constraints come from limited resources (≤) or minimum requirements (≥); non-negativity means x ≥ 0, y ≥ 0.
A table with products as columns and resources as rows makes the constraints easy to read off.
Profit or revenue problems are maximisation problems; cost or diet problems are minimisation problems.
Get a ✓ Verified tutor for “Exercise 6.1 – Formulating a linear programming problem” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Identify the parts of: Maximise z = 40x + 30y subject to 2x + y ≤ 20, x + 3y ≤ 30, x ≥ 0, y ≥ 0.
Answer: Two variables, one objective, two resource constraints, two non-negativity constraints
A workshop makes tables (profit Rs 300) and chairs (profit Rs 100). A table needs 3 hours of carpentry and 1 hour of polishing; a chair needs 1 hour of each. 30 carpentry hours and 14 polishing hours are available. Formulate the LPP.
Answer: Max z = 300x + 100y s.t. 3x + y ≤ 30, x + y ≤ 14, x, y ≥ 0
Food P costs Rs 20 per unit and has 3 units of protein and 1 unit of iron; food Q costs Rs 30 per unit and has 2 units of protein and 4 units of iron. A diet needs at least 12 units of protein and 8 units of iron. Formulate.
Answer: Min z = 20x + 30y s.t. 3x + 2y ≥ 12, x + 4y ≥ 8, x, y ≥ 0
Seema can invest at most Rs 60,000 in bonds (8% p.a.) and deposits (6% p.a.), with at least Rs 10,000 in deposits. Formulate the LPP for maximum interest.
Answer: Max z = 0.08x + 0.06y s.t. x + y ≤ 60,000, y ≥ 10,000, x, y ≥ 0
| What | Formula | Symbols |
|---|---|---|
| General maximisation form | Max z = c₁x + c₂y s.t. a₁x + b₁y ≤ r₁, …, x, y ≥ 0 | Max z = 300x + 100y |
| Resource constraint | (use per x)·x + (use per y)·y ≤ available | 3x + y ≤ 30 |
| Requirement constraint | (content per x)·x + (content per y)·y ≥ needed | 3x + 2y ≥ 12 |
| Objective (profit) | z = (profit per x)·x + (profit per y)·y | z = 300x + 100y |
| Objective (cost) | z = (cost per x)·x + (cost per y)·y | z = 20x + 30y |
| Time constraint | distance/speed summed ≤ time | x/60 + y/90 ≤ 1 |
| Non-negativity | x ≥ 0, y ≥ 0 | No negative production |
Solve each one in your notebook first. Then open the solution and compare every step.
1. Q1. Gadgets A and B need 10 and 6 foundry hours and 5 and 4 machine-shop hours; 60 and 35 hours are available. Profits Rs 30 and Rs 20. Formulate.
Answer: Max z = 30x + 20y s.t. 10x + 6y ≤ 60, 5x + 4y ≤ 35, x, y ≥ 0
2. Q2. Each animal needs at least 14, 22 and 1 units of nutrients A, B, C. Fodder 1 has 2, 2, 1 units and costs Rs 3; fodder 2 has 1, 3, 1 units and costs Rs 2. Formulate to minimise cost.
Answer: Min z = 3x + 2y s.t. 2x + y ≥ 14, 2x + 3y ≥ 22, x + y ≥ 1, x, y ≥ 0
3. Q3. Chemicals A and B use raw materials P (3 and 2 units, 120 available) and Q (2 and 5 units, 160 available); profits Rs 350 and Rs 400. Formulate.
Answer: Max P = 350x + 400y s.t. 3x + 2y ≤ 120, 2x + 5y ≤ 160, x, y ≥ 0
4. Q4. Magazines A and B earn Rs 10 and Rs 15 per copy. A needs 2, 5, 2 hours on machines I, II, III; B needs 3, 2, 6 hours; availability 36, 50, 60 hours. Formulate.
Answer: Max z = 10x + 15y s.t. 2x + 3y ≤ 36, 5x + 2y ≤ 50, 2x + 6y ≤ 60, x, y ≥ 0
5. Q5. A package of bulbs needs 1 h on M1 and 3 h on M2; tubes need 2 h and 4 h. M1 runs at most 10 h and M2 at most 12 h a day. Profits Rs 13.5 and Rs 55. Formulate.
Answer: Max P = 13.5x + 55y s.t. x + 2y ≤ 10, 3x + 4y ≤ 12, x, y ≥ 0
6. Q6. Fertilisers F1 and F2 use A (2 and 3 units, 40 available) and B (1 and 4 units, 70 available); profits Rs 500 and Rs 750. Formulate.
Answer: Max z = 500x + 750y s.t. 2x + 3y ≤ 40, x + 4y ≤ 70, x, y ≥ 0
7. Q7. Foods A and B (Rs 4.5 and Rs 3.5 per unit) contain fat 4 and 6, carbohydrates 14 and 12, protein 8 and 8 units; at least 18, 28 and 14 units are needed. Formulate.
Answer: Min z = 4.5x + 3.5y s.t. 4x + 6y ≥ 18, 14x + 12y ≥ 28, 8x + 8y ≥ 14, x, y ≥ 0
8. Q8. John spends Rs 5 per km at 60 km/h and Rs 8 per km at 90 km/h, has Rs 600 for petrol and wants to cover the greatest distance within one hour. Formulate.
Answer: Max 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 of cement (Rs 20 per kg) and at most 2 kg of sand (Rs 6 per kg). Formulate to minimise cost.
Answer: Min 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 LPP the objective function must be
Answer: B. Hence 'linear' programming.
2. 'Machine time available is 60 hours' leads to a constraint of type
Answer: C. Cannot exceed the available time.
3. 'Diet must contain at least 22 units of B' leads to
Answer: A. Minimum requirement.
4. Non-negativity constraints are
Answer: D. No negative production.
5. A gives profit Rs 30, B Rs 20. Objective:
Answer: C. Profit to be maximised.
6. A needs 10 h in the foundry, B needs 6 h; 60 h available. Constraint:
Answer: A. Hours used ≤ hours available.
7. John travels x km at 60 km/h and y km at 90 km/h within one hour:
Answer: C. Time = distance/speed.
8. Cement Rs 20 per kg and sand Rs 6 per kg. Objective:
Answer: A. Cost is minimised.
9. Which is NOT linear?
Answer: A. xy is a product of variables.
10. The quantities to be decided in an LPP are called
Answer: A. Definition.
11. Fodder 1 has 1 unit of C, fodder 2 has 1 unit; 1 unit needed. Constraint:
Answer: A. Minimum requirement.
12. Raw material P: 3 units for A, 2 for B, 120 available.
Answer: C. Read each product's column.
13. Petrol Rs 5 per km at 60 km/h and Rs 8 per km at 90 km/h; budget Rs 600:
Answer: A. Spending within budget.
14. Investment of at most Rs 45,000 in x and y:
Answer: D. Total limited.
15. An LPP is also called
Answer: B. It optimises an objective.
Get a ✓ Verified tutor for “Exercise 6.1 – Formulating a linear programming problem” — live online or at home. We aim to suggest up to 3 tutors within 24 hours.
Done with the notes? Revise Exercise 6.1 – Formulating a linear programming problem 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 35 minutes
Get a ✓ Verified tutor for “Exercise 6.1 – Formulating a linear programming problem” — 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 6.1 – Formulating a linear programming problem.
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 6.1” — 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.