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
3.8k views
in Linear Programming by (25.7k points)
closed by

A manufacture produces two types of steel trunks. He has two machines, A and B. The first type of trunk requires 3 hours on machine A and 3 hours on machine B. The second type required 3 hours on machine A and 2 hours on Machine A and 2 hours on machine B. Machine A and B can work at most for 18 hours and 15 hours per day respectively. He earns a profit of ₹30 and ₹25 per trunk of the first type and second type respectively. How may trunks of each type must he make each day to make the maximum profit?

1 Answer

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

Let the manufacturer manufacture x and y numbers of type 1 and type 2 trunks.

∴According to the question,

3X + 3y ≤ 18, 3x + 2y ≤ 15, x ≥ 0, y ≥ 0

Maximize Z = 30x + 25y

The feasible region determined 3X + 3y ≤ 18, 3x + 2y ≤ 15, x ≥ 0, y ≥ 0 is given by

The corner points of feasible region are A(0,0) , B(0,6) , C(3,3) , D(5,0).

The value of Z at corner point is

Corner Point Z = 30x + 25y
A(0, 0) 0
B(0, 6) 150
C(3, 3) 165 Maximum
D(5, 0) 150

The maximum value of Z is165 and occurs at point (3,3).

The manufacturer should manufacture 3 trunks of each type to earn maximum profit of Rs.165.

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

...