Solutions for Class 12 Mathematics: Chapter 13 Linear Programming
Access comprehensive textbook solutions for Chapter 13 Linear Programming using the reference material for Class 12 Mathematics. Designed to align with the 2026 academic curriculum, these detailed answers help students reinforce core academic concepts and master complex problem-solving methods.
Practice Class 12 Mathematics Solutions: Chapter 13 Linear Programming
Navigate directly to the solved Mathematics textbook exercises using the digital viewer below. Each solution includes detailed step-by-step explanations, allowing students to instantly cross-check their work and identify areas requiring further revision.
Short Answer Questions
Question 1. A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is ₹100 and that on a bracelet is ₹300. Formulate an LPP. for finding how many of each should be produced daily to maximise the profit? It is being given that at least one of each must be produced.
Solution.
Let x and y be the number of necklaces and bracelets manufactured by small firm per day. If P be the profit, then objective function is given by
P = 100x + 300y which is to be maximised under the constrains
x + y ≤ 24 ...(i)
12x+y≤16 ...(ii)
x ≥ 1, y ≥ 1 ...(iii)
Teacher's Note: Form the linear programming problem with variables, a profit objective and constraints from time and number limits.
Exam Note: Define variables, objective and all constraints including non-negativity.
Question 2. Two tailors, A and B, earn ₹300 and ₹400 per day respectively. A can stitch 6 shirts and 4 pairs of trousers while Bcan stitch 10 shirts and 4 pairs of trousers per day. To find how many days should each of them work and if it is desired to produce at least 60 shirts and 32 pairs of trousers at a minimum labour cost, formulate this as an LPP.
Solution.
Let A and B work for x and y days respectively.
Let Z be the labour cost.
Z = 300x + 400y
Subject to constraints
6x + 10y ≥ 60
4x + 4y ≥ 32
x, y ≥ 0
Teacher's Note: Let days worked be variables, write cost to minimise and constraints from minimum output required.
Exam Note: State variables, objective and constraints with non-negativity.
Question 3. A company produces two types of goods A and B, that require gold and silver. Each unit of type A requires 3 g of silver and 1 g of gold while that of type B requires 1 g of silver and 2 g of gold. The company can produce a maximum of 9 g of silver and 8 g of gold. If each unit of type A brings a profit of ₹40 and that of type B ₹50, formulate LPP to maximize profit.
Solution.
Let x and y be the number of goods A and goods B respectively. If P be the profit then
P = 40x + 50y which is to be maximised under constraints
3x + y ≤ 9
x + 2y ≤ 8
x ≥ 0, y ≥ 0
Teacher's Note: Define variables, write the profit as a linear objective, and convert each resource limit into an inequality.
Exam Note: Define x, y; state objective and all constraints.
Question 4. A firm has to transport atleast 1200 packages daily using large vans which carry 200 packages each and small vans which can take 80 packages each. The cost for engaging each large van is ₹400 and each small van is ₹200. Not more than ₹3,000 is to be spent daily on the job and the number of large vans cannot exceed the number of small vans. Formulate this problem as a LPP given that the objective is to minimize cost.
Solution.
Let the number of large vans and small vans be x and y respectively.
here transportation cost Z be objective be function,
Z = 400x + 200y which is to be minimized under constraints
200 x + 80y ≥ 1200 ⇒ 5x + 2y ≥ 30
400 x + 200y ≤ 3000 ⇒ 2x + y ≤ 15
x ≤ y, x ≥ 0, y ≥ 0
Teacher's Note: The aim is minimum cost, so total hiring cost is the objective and capacity, budget and van limits are constraints.
Exam Note: State Z to minimise, list constraints, include x, y at least 0.
Free study material for Mathematics
Class 12 Mathematics: Xam Idea Solutions for Xam Idea Solutions Class 12 Maths Chapter 13 Linear Programming Short Answer Questions
Chapter-wise Xam Idea Solutions: Xam Idea Solutions Class 12 Maths Chapter 13 Linear Programming Short Answer Questions
Explore reliable mathematical solutions for Xam Idea Solutions Class 12 Maths Chapter 13 Linear Programming Short Answer Questions tailored for Class 12 learners. Utilizing these complete exercise answers ensures your preparation aligns exactly with standard academic requirements.
Mastering Core Concepts with Xam Idea Solutions
Beyond providing the final numerical answer, these guides break down the underlying mathematical principles. Cross-referencing completed work with these structured explanations helps eliminate calculation errors and reinforces conceptual clarity.
Explore More Study Resources for Class 12 Math
In addition to these Xam Idea Solutions chapters, students can explore a wider library of free online mock tests, printable sample papers, and short revision notes aligned with the 2026 academic session.
FAQs
They are chapter-wise solved questions from the book for Class 12 Mathematics. Each answer is explained step by step so you can check your work and revise.
Yes. All chapters can be read online for free on a phone, tablet or computer, and no sign-up is needed.
Try each question on your own first, then read the solution. Use it to check your steps, correct mistakes and learn how a full answer is written.
Regular practice improves accuracy and speed and shows which topics need more revision. It works best alongside your textbook and class notes.
Yes. The chapter list on this page links to every chapter’s solved questions, so you can open the topic you are studying.
They are listed for the 2026-27 session. Check that the questions match the textbook edition you use.