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

A manufacture makes two types, A and B, of teapots. Three machines are needed for the manufacture and the time required for each teapot on the machines is given below. 

Each machine is available for a maximum of 6 hours per day. If the profit on each teapot of type A is 75 paise and that on each teapot of type B is 50 paise, show that 15 teapots of type A and 30 of type B should be manufactured in a day to get the maximum profit.

Machine Time (in minutes)
Type I II III
A 12 18 6
B 6 0 9

1 Answer

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

Let x teapots of type A and y teapots of type B manufactured. 

Then, 

x ≥ 0, y ≥ 0 

Also, 

12x + 6y ≤ 6 × 60 

12x + 6y ≤ 360 

2x + y ≤ 60…..(1) 

And, 

18x + 0y ≤ 6 × 60 

X ≤ 20……(2) 

Also, 

6x + 9y ≤ 6 × 60 

2x + 3y ≤ 120…..(3) 

The profit will be given by: Z \(=\frac{75}{100}x+\frac{50}{100}y\)\(\Rightarrow Z=\frac{3}{4}x+\frac{1}{2}y\)

On plotting the constraints, we get,

Profit will be maximum when x = 30 and y = 15 

Hence, Proved.

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

...