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

A small firm manufacturers gold rings and chains. The total number of rings and chains manufactured per day is atmost 24. It takes 1 hour to make a ring and 30 minutes to make a chain. The maximum number of hours available per day is 16. If the profit on a ring is Rs 300 and that on a chain is Rs 190, find the number of rings and chains that should be manufactured per day, so as to earn the maximum profit. Make it as an LPP and solve it graphically.

Please log in or register to answer this question.

1 Answer

0 votes
by (12.4k points)

Total number of rings and chains manufactured per day = 24

Time taken in manufacturing ring = 1 hour

Time taken in manufacturing chain = 30 minutes

Time available per day = 16 hours

Maximum profit on ring = Rs 300

Maximum profit on chain = Rs 190

Let number of gold rings manufactured per day = x and chains manufactured per day = y

LPP is

Maximize Z = 300x + 190y ...(i)

Subject to constraints x ≥ 0, y ≥ 0 ...(ii)

x + y ≤ 24 ........(iii)

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

Possible points for maximum Z are

A (0, 24), B (8, 16) and C (16, 0).

Z is maximum at (8, 16).

Hence, 8 gold rings and 16 chains must be manufactured per day.

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

...