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
493 views
in Linear Programming by (15.3k points)

A small firm manufactures necklaces and bracelets. The total number of necklaces and bracelets that it can handle per day is at most 24. It takes one hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is RS 100 and that on a bracelet is Rs 300. Formulate an LPP. for finding how many of each should be produced daily to maximise the profit? It is being given that at least one of each must be produced.

Please log in or register to answer this question.

1 Answer

0 votes
by (12.4k points)

Let x and y be the number of necklaces and bracelets manufactured by small firm per day. If P be the profit, then objective function is given by 

P = 100x + 300y which is to be maximised under the constrains 

x + y ≤ 24 ...(i) 

12x + y ≤ 16 ...(ii) 

x ≥ 1, y ≥ 1 ...(iii)

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

...