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

The standard weight of a special purpose brick is 5 kg and it must contain two basic ingredients B1 and B2. B1costs Rs 5 per kg and B2 costs Rs 8 per kg. Strength considerations dictate that the brick should contain not more than 4 kg of B1 and minimum 2 kg of B2. Since the demand for the product is likely to be related to the price of the brick, find the minimum cost of brick satisfying the above conditions. Formulate this situation as an LPP and solve it graphically.

Please log in or register to answer this question.

1 Answer

0 votes
by (12.4k points)

Let x kg of B1 and y kg of B2 are taken for making brick.

Here, Z = 5x + 8y is the cost which is objective function and is to be maximised subjected to following constraints.

x + y = 5 ….. (i)

x ≤ 4 …..(ii)

y ≥ 2 ........(iii)

x ≥ 0, y ≥ 0 ….. (iv)

In this case, constraint (i) is a line passing through the feasible region determined by constraints (ii), (iii) and (iv).

Therefore, maximum or minimum value of objective function ‘Z’ exist on end points of line (constraint) (i) in feasible region i.e., at A or B.

At A (3, 2) Z = 5 × 3 + 8 × 2 = 15 + 16 = 31

At B (0, 5) Z = 5 × 0 + 8 × 5 = 0 + 40 = 40

Hence, cost of brick is minimum when 3 kg of B1 and 2 kg of B2 are taken.

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

...