Linear Programming Class 12 Maths 1 Exercise 7.2 Solutions Maharashtra Board

Balbharti 12th Maharashtra State Board Maths Solutions Book Pdf Chapter 7 Linear Programming Ex 7.2 Questions and Answers.

12th Maths Part 1 Linear Programming Exercise 7.2 Questions And Answers Maharashtra Board

I) Find the feasible solution of the following inequations graphically.
Question 1.
3x + 2y ≤ 18, 2x + y ≤ 10, x ≥ 0, y ≥ 0
Solution:
First we draw the lines AB and CD whose equations are 3x + 2y = 18 and 2x + y = 10 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-1-1
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-2
The feasible solution is OCPBO which is shaded in the graph.

Question 2.
2x + 3y ≤ 6, x + y ≥ 2, x ≥ 0, y ≥ 0
Solution:
First we draw the lines AB and CB whose equations are 2x + 3y = 6 and x + y = 2 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-3
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-4
The feasible solution is ∆ABC which is shaded in the graph.

Maharashtra-Board-Solutions

Question 3.
3x + 4y ≥ 12, 4x + 7y ≤ 28, y ≥ 1, x ≥ 0
Solution:
First we draw the lines AB, CD and EF whose equations are 3x + 4 y = 12, 4x + 7y = 28 and y = 1 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-5
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-6
The feasible solution is PQDBP. which is shaded in the graph.

Question 4.
x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0.
Solution:
First we draw the lines AB, CD and EF whose equations are x + 4y = 24, 3x + y = 21 and x + y = 9 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-7
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-8
The feasible solution is OCPQBO. which is shaded in the graph.

Maharashtra-Board-Solutions

Question 5.
0 ≤ x ≤ 3, 0 ≤ y ≤ 3, x + y ≤ 5, 2x + y ≥ 4
Solution:
First we draw the lines AB, CD, EF and GH whose equations are x + y = 5, 2x + y = 4, x = 3 and y = 3 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-9
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-10
The feasible solution is CEPQRC. which is shaded in the graph.

Maharashtra-Board-Solutions

Question 6.
x – 2y ≤ 2, x + y ≥ 3, -2x + y ≤ 4, x ≥ 0, y ≥ 0
Solution:
First we draw the lines AB, CD and EF whose equations are x – 2y = 2, x + y = 3 and -2x + y = 4 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-11
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-12
The feasible solution is shaded in the graph.

Question 7.
A company produces two types of articles A and B which requires silver and gold. Each unit of A requires 3 gm of silver and 1 gm of gold, while each unit of B requires 2 gm of silver and 2 gm of gold. The company has 6 gm of silver and 4 gm of gold. Construct the inequations and find the feasible solution graphically.
Solution:
Let the company produces x units of article A and y units of article B.
The given data can be tabulated as:
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-13
Inequations are :
x + 2y ≤ 4 and 3x + 2y ≤ 6
x and y are number of items, x ≥ 0, y ≥ 0
First we draw the lines AB and CD whose equations are x + 2y = 4 and 3x + 2y = 6 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-14
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-15
The feasible solution is OCPBO. which is shaded in the graph.

Maharashtra-Board-Solutions

Question 8.
A furniture dealer deals in tables and chairs. He has Rs.1,50,000 to invest and a space to store at most 60 pieces. A table costs him Rs.1500 and a chair Rs.750. Construct the inequations and find the feasible solution.
Question is modified
A furniture dealer deals in tables and chairs. He has ₹ 15,000 to invest and a space to store at most 60 pieces. A table costs him ₹ 150 and a chair ₹ 750. Construct the inequations and find the feasible solution.
Solution:
Let x be the number of tables and y be the number of chairs. Then x ≥ 0, y ≥ 0.
The dealer has a space to store at most 60 pieces.
∴ x + y ≤ 60
Since, the cost of each table is ₹ 150 and that of each chair is ₹ 750, the total cost of x tables and y chairs is 150x + 750y. Since the dealer has ₹ 15,000 to invest, 150x + 750y ≤ 15,000
Hence the system of inequations are
x + y ≤ 60, 150x + 750y ≤ 15000, x ≥ 0, y ≥ 0.
First we draw the lines AB and CD whose equations are x + y = 60 and 150x + 750y = 15,000 respectively.
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-16
Maharashtra-Board-12th-Maths-Solutions-Chapter-7-Linear-Programming-Ex-7.2-17
The feasible solution is OAPDO. which is shaded in the graph.

✨ Free AI tutor

Ask the AI tutor about Class 12 Maths Chapter 7

Stuck 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.2” — 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 ask

How the free AI tutor works →

👩‍🏫 Class 12 Maths classes near you — online or at home

Prefer a real teacher? TalentJR teachers take live online classes anywhere in India and visit homes in selected cities. Tell us what you need and our team will call you with timings and fees.

Live online classesSmall groups or 1:1 with a teacher, from home, any city.
Teacher at homeA TalentJR teacher visits your home (selected cities).
At a centreClasses at a TalentJR partner centre near you, where available.

Keep learning