Use app×
Join Bloom Tuition
One on One Online Tuition
JEE MAIN 2025 Foundation Course
NEET 2025 Foundation Course
CLASS 12 FOUNDATION COURSE
CLASS 10 FOUNDATION COURSE
CLASS 9 FOUNDATION COURSE
CLASS 8 FOUNDATION COURSE
0 votes
1.7k views
in Linear Programming by (27.7k points)
closed by

A manufactures produces two types of soap bars using two machines, A and B. A is operated for 2 minutes and B for 3 minutes to manufacture the first type, while it takes 3 minutes on machine A and 5 minutes on machine B to manufacture the second type. Each machine can be operated at the most for 8 hours per day. The two types of soap bars are sold at a profit of ₹0.25 and ₹0.50 each. Assuming that the manufacture can sell all the soap bars he can manufacture, how many bars of soap of each type should be manufactured per day so as to maximize his profit?

1 Answer

+1 vote
by (25.8k points)
selected by
 
Best answer

Let x and y be number of soaps be manufactured of 1st and 2nd type. 

∴According to the question, 

2x + 3y ≤ 480 , 3x + 5y ≤ 480, x ≥ 0, y ≥ 0 

Maximize Z = 0.25x + 0.50y 

The feasible region determined by 2x + 3y ≤ 480 , 3x + 5y ≤ 480, x ≥ 0, y ≥ 0 is given by

The corner points of feasible region are A(0,96) , B(0,0) , C(160,0). 

The value of Z at corner points are

Corner Point Z = 0.25x + 0.50y
A(0, 96) 48 Maximum
B(0, 0) 0
C(160, 0) 40

The maximum value of Z is 48 at point (0,96). 

Hence, the manufacturer should make 96 soaps of the 2nd type to make maximum profit.

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...