Xam Idea Solutions Class 12 Maths Chapter 13 Linear Programming Long Answer Questions-II (PYQ)

Download Class 10 Mathematics Textbook Solutions: Chapter 15 Probability

Access comprehensive textbook solutions for Chapter 15 Probability using the reference material for Class 10 Mathematics. Designed to align with the 2026 academic curriculum, these detailed answers help students reinforce core academic concepts and master complex problem-solving methods.

Access Textbook Answers and Solutions

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.

Question 1. A cottage industry manufactures pedestal lamps and wooden shades, each requiring the use of a grinding/cutting machine and a sprayer. It takes 2 hours on grinding/cutting machine and 3 hours on the sprayer to manufacture a pedestal lamp. It takes 1 hour on the grinding/cutting machine and 2 hours on the sprayer to manufacture a shade. On any day, the sprayer is available for at the most 20 hours and the grinding/cutting machine for at the most 12 hours. The profit from the sale of a lamp is ₹ 5 and that from a shade is ₹ 3. Assuming that the manufacturer can sell all the lamps and shades that he produces, how should he schedule his daily production in order to maximise his profit?

Solution.

Let the manufacturer produce x pedestal lamps and y wooden shades. The time on the grinding/cutting machine is (2x + y) hours and on the sprayer (3x + 2y) hours.

Maximise Z = 5x + 3y subject to 3x + 2y ≤ 20, 2x + y ≤ 12, x ≥ 0, y ≥ 0.

The feasible region (shaded) OABC is bounded. Z at each corner point is:

XY(0, 0)(6, 0)(4, 4)(0, 10)
Corner pointZ = 5x + 3y
(0, 0)0
(6, 0)30
(4, 4)32
(0, 10)30

The maximum value of Z is ₹ 32 at B(4, 4). Hence, the manufacturer should produce 4 lamps and 4 shades to get the maximum profit of ₹ 32.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 2. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5 hours of machine time and 3 hours of craftman’s time in its making while a cricket bat takes 3 hours of machine time and 1 hour of craftman’s time. In a day, the factory has the availability of not more than 42 hours of machine time and 24 hours of craftsman’s time. If the profit on a racket and on a bat is ₹20 and ₹10 respectively, find the number of tennis rackets and cricket bats that the factory must manufacture to earn the maximum profit. Make it as an LPP and solve it graphically.

Solution.

Let the factory make x tennis rackets and y cricket bats. Maximise Z = 20x + 10y subject to 1.5x + 3y ≤ 42 (machine time), 3x + y ≤ 24 (craftsman’s time), x, y ≥ 0.

The feasible region is the shaded region OACB. Solving 1.5x + 3y = 42 and 3x + y = 24 gives y = 12 and x = 4, i.e., the point (4, 12). Z at each corner point is:

XY(0, 0)(8, 0)(4, 12)(0, 14)
Corner pointZ = 20x + 10y
(0, 0)0
(8, 0)160
(4, 12)200
(0, 14)140

The maximum profit is ₹ 200, when the factory makes 4 tennis rackets and 12 cricket bats.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 3. A dealer wishes to purchase a number of fans and sewing machines. He has only ₹ 5,760 to invest and has space for at the most 20 items. A fan costs him ₹ 360 and a sewing machine ₹ 240. He expects to sell a fan at a profit of ₹22 and a sewing machine for a profit of ₹ 18. Assuming that he can sell all the items that he buys, how should he invest his money to maximise his profit? Solve it graphically.

Solution.

Let the dealer purchase x fans and y sewing machines. The cost is 360x + 240y ≤ 5760, i.e., 3x + 2y ≤ 48, and the space condition gives x + y ≤ 20.

Maximise Z = 22x + 18y subject to 3x + 2y ≤ 48, x + y ≤ 20, x, y ≥ 0. The shaded region is the feasible region. Z at each corner point is:

XY(0, 0)(16, 0)(8, 12)(0, 20)
Corner pointZ = 22x + 18y
(0, 0)0
(16, 0)352
(8, 12)392
(0, 20)360

The maximum value of Z is 392 at B(8, 12). Hence the profit is maximum, i.e., ₹ 392, when he buys 8 fans and 12 sewing machines.

For the variant with an electronic machine (₹ 3,600, profit ₹ 220) and a manually operated machine (₹ 2,400, profit ₹ 180) and ₹ 57,600, the constraints are the same and Z = 220x + 180y gives a maximum of ₹ 3,920 at (8, 12).

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 4. The standard weight of a special purpose brick is 5 kg and it must contain two basic ingredients B1 and B2. B1 costs ₹ 5 per kg and B2 costs ₹ 8 per kg. Strength considerations dictate that the brick should contain not more than 4 kg of B1 and minimum 2 kg of B2. Since the demand for the product is likely to be related to the price of the brick, find the minimum cost of brick satisfying the above conditions. Formulate this situation as an LPP and solve it graphically.

Solution.

Let x kg of B1 and y kg of B2 be taken for making the brick. Minimise the cost Z = 5x + 8y subject to x + y = 5, x ≤ 4, y ≥ 2, x, y ≥ 0.

The constraint x + y = 5 is a line passing through the feasible region determined by the other constraints, so the minimum or maximum value of Z occurs at an end point of the line segment in the feasible region, i.e., at A or B.

At A(3, 2): Z = 5 × 3 + 8 × 2 = 15 + 16 = 31

At B(0, 5): Z = 5 × 0 + 8 × 5 = 0 + 40 = 40

XY(3, 2)(0, 5)
Corner pointZ = 5x + 8y
(3, 2)31
(0, 5)40

Hence, the cost of the brick is minimum (₹ 31) when 3 kg of B1 and 2 kg of B2 are taken.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 5. A diet is to contain at least 80 units of Vitamin A and 100 units of minerals. Two foods F1 and F2 are available. Food F1 costs ₹ 4 per unit and F2 costs ₹ 6 per unit. One unit of food F1 contains 3 units of Vitamin A and 4 units of minerals. One unit of food F2 contains 6 units of Vitamin A and 3 units of minerals. Formulate this as a linear programming problem and find graphically the minimum cost for diet that consists of mixture of these two foods and also meets the minimal nutritional requirements.

Solution.

Let x units of food F1 and y units of food F2 be mixed. Minimise the cost Z = 4x + 6y subject to 3x + 6y ≥ 80, 4x + 3y ≥ 100, x, y ≥ 0.

The shaded region is the feasible region, which is unbounded. The corner points and the value of Z at each are:

XY(24, 4/3)(80/3, 0)(0, 100/3)
Corner pointZ = 4x + 6y
(24, 4/3)104
(80/3, 0)320/3
(0, 100/3)200

Since the feasible region is unbounded, graph 4x + 6y < 104. There is no point common to this open half plane and the feasible region (since 4x + 6y = 0.8(3x + 6y) + 0.4(4x + 3y) ≥ 104 on the feasible region).

Hence the minimum cost is ₹ 104, when 24 units of food F1 and 4/3 units of food F2 are used.

Teacher's Note: For an unbounded region, verify the minimum using the open half plane.

Exam Note: Check the open half plane for common points.

Question 6. A small firm manufactures gold rings and chains. The total number of rings and chains manufactured per day is at most 24. It takes 1 hour to make a ring and 30 minutes to make a chain. The maximum number of hours available per day is 16. If the profit on a ring is ₹300 and that on a chain is ₹190, find the number of rings and chains that should be manufactured per day, so as to earn the maximum profit. Make it as an LPP and solve it graphically.

Solution.

Let x rings and y chains be manufactured per day. Maximise Z = 300x + 190y subject to x ≥ 0, y ≥ 0, x + y ≤ 24, x + (1/2)y ≤ 16.

Possible points for the maximum of Z are the corner points of the feasible region:

XY(0, 0)(16, 0)(8, 16)(0, 24)
Corner pointZ = 300x + 190y
(0, 0)0
(16, 0)4800
(8, 16)5440
(0, 24)4560

The maximum profit is ₹ 5,440 at (8, 16). Hence, 8 gold rings and 16 chains must be manufactured per day.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 7. A company produces soft drinks that has a contract which requires that a minimum of 80 units of the chemical A and 60 units of the chemical B go into each bottle of the drink. The chemicals are available in prepared mix packets from two different suppliers. Supplier S had a packet of mix of 4 units of A and 2 units of B that costs ₹10. The supplier T has a packet of mix of 1 unit of A and 1 unit of B that costs ₹4. How many mix packets from S and T should the company purchase to honour the contract requirement and yet minimize cost? Make a LPP and solve it graphically.

Solution.

Let x and y packets of mixes be purchased from S and T respectively. Minimise Z = 10x + 4y subject to 4x + y ≥ 80, 2x + y ≥ 60, x, y ≥ 0.

Solving 2x + y = 60 and 4x + y = 80 gives x = 10, y = 40, i.e., P(10, 40). The feasible region is unbounded. The value of Z at the corner points is:

XY(30, 0)(0, 80)(10, 40)
Corner pointZ = 10x + 4y
(30, 0)300
(0, 80)320
(10, 40)260

Since the feasible region is unbounded, graph 10x + 4y < 260. It has no point common with the feasible region (10x + 4y = 1(4x + y) + 3(2x + y) ≥ 260 there). So the minimum value of Z is 260 at (10, 40).

The minimum cost of each bottle is ₹ 260 if the company purchases 10 packets of mixes from S and 40 packets from T.

Teacher's Note: For an unbounded region, verify the minimum using the open half plane.

Exam Note: Check the open half plane for common points.

Question 8. A manufacturing company makes two types of teaching aids A and B of mathematics for Class XII. Each type of A requires 9 labour hours for fabricating and 1 labour hour for finishing. Each type of B requires 12 labour hours for fabricating and 3 labour hours for finishing. For fabricating and finishing, the maximum labour hours available are 180 and 30, respectively. The company makes a profit of ₹ 80 on each piece of type A and ₹ 120 on each piece of type B. How many pieces of type A and B should be manufactured per week to get a maximum profit? What is the maximum profit per week?

Solution.

Let x and y be the number of pieces of type A and B manufactured per week. Maximise Z = 80x + 120y subject to 9x + 12y ≤ 180 (i.e., 3x + 4y ≤ 60), x + 3y ≤ 30, x, y ≥ 0.

The feasible region OABC is bounded, with corner points O(0, 0), A(20, 0), B(12, 6) and C(0, 10). Z at the corner points is:

XY(0, 0)(20, 0)(12, 6)(0, 10)
Corner pointZ = 80x + 120y
(0, 0)0
(20, 0)1600
(12, 6)1680
(0, 10)1200

The company will get the maximum profit of ₹ 1,680 by making 12 pieces of type A and 6 pieces of type B.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 9. A cooperative society of farmers has 50 hectares of land to grow two crops A and B. The profits from crops A and B per hectare are estimated as ₹ 10,500 and ₹ 9,000 respectively. To control weeds, a liquid herbicide has to be used for crops A and B at the rate of 20 litres and 10 litres per hectare, respectively. Further not more than 800 litres of herbicide should be used in order to protect fish and wildlife using a pond which collects drainage from this land. Keeping in mind that the protection of fish and other wildlife is more important than earning profit, how much land should be allocated to each crop so as to maximize the total profit? Form an LPP from the above and solve it graphically.

Solution.

Let x and y hectares of land be allocated to crops A and B respectively. Maximise Z = 10500x + 9000y subject to x + y ≤ 50, 20x + 10y ≤ 800 (i.e., 2x + y ≤ 80), x ≥ 0, y ≥ 0.

The feasible region OABC is bounded, with corner points O(0, 0), A(40, 0), B(30, 20) and C(0, 50). Z at the corner points is:

XY(0, 0)(40, 0)(30, 20)(0, 50)
Corner pointZ = 10500x + 9000y
(0, 0)0
(40, 0)420000
(30, 20)495000
(0, 50)450000

The society will get the maximum profit of ₹ 4,95,000 by allocating 30 hectares to crop A and 20 hectares to crop B.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 10. A manufacturer considers that men and women workers are equally efficient and so he pays them at the same rate. He has 30 and 17 units of workers (male and female) and capital respectively, which he uses to produce two types of goods A and B. To produce one unit of A, 2 workers and 3 units of capital are required while 3 workers and 1 unit of capital is required to produce one unit of B. If A and B are priced at ₹ 100 and ₹120 per unit respectively, how should he use his resources to maximise the total revenue? Form the above as an LPP and solve graphically.

Solution.

Let x and y units of goods A and B be produced respectively. Maximise Z = 100x + 120y subject to 2x + 3y ≤ 30 (workers), 3x + y ≤ 17 (capital), x, y ≥ 0.

Solving the two equations gives C(3, 8). The feasible region is bounded. Z at the corner points is:

XY(0, 0)(17/3, 0)(3, 8)(0, 10)
Corner pointZ = 100x + 120y
(0, 0)0
(17/3, 0)1700/3
(3, 8)1260
(0, 10)1200

The maximum revenue is ₹ 1,260 when 3 units of A and 8 units of B are produced.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 11. An aeroplane can carry a maximum of 200 passengers. A profit of ₹ 500 is made on each executive class ticket out of which 20% will go to the welfare fund of the employees. Similarly a profit of ₹ 400 is made on each economy ticket out of which 25% will go for the improvement of facilities provided to economy class passengers. In both cases, the remaining profit goes to the airline’s fund. The airline reserves at least 20 seats for executive class. However, at least four times as many passengers prefer to travel by economy class than by the executive class. Determine, how many tickets of each type must be sold in order to maximise the net profit of the airline. Make the above as an LPP and solve it graphically.

Solution.

Let x executive class and y economy class tickets be sold. Net profit per executive ticket = 80% of ₹ 500 = ₹ 400 and per economy ticket = 75% of ₹ 400 = ₹ 300.

Maximise Z = 400x + 300y subject to x + y ≤ 200, x ≥ 20, y ≥ 4x (which with x + y ≤ 200 gives x ≤ 40), x, y ≥ 0.

The feasible region has corner points A(20, 80), B(40, 160) and C(20, 180). Z at the corner points is:

XY(20, 80)(40, 160)(20, 180)
Corner pointZ = 400x + 300y
(20, 80)32000
(40, 160)64000
(20, 180)62000

The maximum net profit is ₹ 64,000. Hence, 40 tickets of executive class and 160 tickets of economy class should be sold to maximise the net profit of the airline.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Question 12. A factory owner purchases two types of machines, A and B for his factory. The requirements and the limitations for the machines are as follows: Machine A needs 1000 m² area, 12 men and gives a daily output of 60 units; Machine B needs 1200 m² area, 8 men and gives a daily output of 40 units. He has a maximum area of 7500 m² available and 72 skilled men. If the daily output is to be maximised, how many machines of each type should he buy?

Solution.

Let x machines of type A and y machines of type B be purchased. Maximise Z = 60x + 40y subject to 1000x + 1200y ≤ 7500 (i.e., 10x + 12y ≤ 75), 12x + 8y ≤ 72 (i.e., 3x + 2y ≤ 18), x, y ≥ 0.

The shaded region is the feasible region, which is bounded. Z at each corner point is:

XY(0, 0)(6, 0)(33/8, 45/16)(0, 25/4)
Corner pointZ = 60x + 40y
(0, 0)0
(6, 0)360
(33/8, 45/16)360
(0, 25/4)250

The maximum value of Z is 360, attained at (6, 0) and also at (33/8, 45/16). Since x and y must be whole numbers, the second point is not possible.

Hence there must be 6 machines of type A and no machine of type B for the maximum daily output.

Teacher's Note: For a bounded region, compare Z at all corner points.

Exam Note: Formulate, graph, evaluate Z, state answer.

Step-by-Step Xam Idea Solutions for Class 10 Math

Complete Math Solutions for Xam Idea Solutions Class 12 Maths Chapter 13 Linear Programming Long Answer Questions-II (PYQ)

Explore reliable mathematical solutions for Xam Idea Solutions Class 12 Maths Chapter 13 Linear Programming Long Answer Questions-II (PYQ) tailored for Class 10 learners. Utilizing these complete exercise answers ensures your preparation aligns exactly with standard academic requirements.

Concept-Driven Math Answers

Clear, methodical explanations accompany every challenging problem within the text. Engaging with these detailed mathematical breakdowns lays a solid foundation for advanced learning and improves execution speed for upcoming exams.

Explore More Study Resources for Class 10 Math

Wrap up your chapter revision by testing your knowledge against standard objective question formats. Explore our full library of up-to-date syllabus details and mock evaluations to secure top grades in your math examinations.

FAQs

What are these [current-page:node:field_author] Solutions for Class 10 Mathematics?

They are chapter-wise solved questions from the book for Class 10 Mathematics. Each answer is explained step by step so you can check your work and revise.

Are the [current-page:node:field_author] Class 10 Mathematics Solutions free to read?

Yes. All chapters can be read online for free on a phone, tablet or computer, and no sign-up is needed.

How should I use these [current-page:node:field_author] solutions for Class 10 Mathematics?

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.

Will practising [current-page:node:field_author] Class 10 Mathematics questions help in exams?

Regular practice improves accuracy and speed and shows which topics need more revision. It works best alongside your textbook and class notes.

Are these solutions arranged chapter by chapter?

Yes. The chapter list on this page links to every chapter’s solved questions, so you can open the topic you are studying.

Which session are these Class 10 Mathematics Solutions for?

They are listed for the 2026-27 session. Check that the questions match the textbook edition you use.