Q2 of 118 Page 31

A manufacturer has three machines installed in his factory. Machines I and II are capable of being operated for at most 12 hours whereas Machine III must operate at least for 5 hours a day. He produces only two items, each requiring the use of three machines. The number of hours required for producing one unit each of the items on the three machines is given in the following table :


He makes a profit of Rs 6.00 on item A and Rs 4.00 on item B. Assuming that he can sell all that he produces, how many of each item should he produce to maximize his profit? Determine his maximum profit. Formulate this LPP mathematically and then solve it.

Let x units of item A and y units of item B be manufactured. Therefore, x, y 0.


As we are given,



Machines I and II are capable of being operated for at most 12 hours whereas Machine III must operate at least for 5 hours a day.


According to the question, the constraints are


x + 2y 12


2x + y 12


x + y 5


He makes a profit of Rs 6.00 on item A and Rs. 4.00 on item B. Profit made by him in producing x items of A and y items of B is 6x + 4y.


Total profit Z = 6x + 4y which is to be maximized


Thus, the mathematical formulation of the given linear programming problem is


Max Z = 6x + 4y, subject to


x + 2y 12


2x + y 12


x + y 5


x, y 0


First, we will convert the inequations into equations as follows:


x + 2y = 12, 2x + y = 12, x + y = 5, x = 0 and y = 0.


The region represented by x + 2y 12


The line x + 2y = 12 meets the coordinate axes at A(12,0) and B(0,6) respectively. By joining these points, we obtain the line x + y = 12. Clearly (0, 0) satisfies the x + 2y = 12. So, the region which contains the origin represents the solution set of the inequation x + 2y 12


The region represented by 2x + y 12


The line 2x + y = 12 meets the coordinate axes at C(6,0) and D(0,12) respectively. By joining these points, we obtain the line 2x + y = 12. Clearly (0, 0) satisfies the 2x + y = 12. So, the region which contains the origin represents the solution set of the inequation 2x + y 12


The region represented by x + y 5


The line x + y 5 meets the coordinate axes at E(5,0) and F(0,4) respectively. By joining these points, we obtain the line x + y = 5. Clearly (0, 0) satisfies the x + y 5. So, the region which does not contain the origin represents the solution set of the inequation x + y 5


The region represented by x 0, y 0 :


Since every point in the first quadrant satisfies these inequations. So, the first quadrant is the region represented by the inequations x 0 and y 0.


The feasible region determined by the system of constraints


x + 2y 12, 2x + y 12, x + y 5, x, y 0 are as follows.


2.jpg


Thus the maximum profit is of Rs 40 obtained when 4 units each of item A and B are manufactured.


The corner points are D(0,6), I(4,4), C(6,0), G(5,0), and H(0,4). The values of Z at these corner points are as follows:



The maximum value of Z is 40 which is attained at I(4, 4).


More from this chapter

All 118 →
15

A fruit grower can use two types of fertilizer in his garden, brand P and Q. The amounts (in kg) of nitrogen, phosphoric acid, potash, and chlorine in a bag of each brand are given in the table. Tests indicate that the garden needs at least 240 kg of phosphoric acid, at least 270 kg of potash and at most 310 kg of chlorine.


If the grower wants to minimize the amount of nitrogen added to the garden, how many bags of each brand should be used? What is the minimum amount of nitrogen added in the garden?

 1

If a young man drives his scooter at a speed of 25 km/hr, he has to spend Rs2 per km on petrol. If he drives the scooter at a speed of 40 km/hour, it produces air pollution and increases his expenditure on petrol to Rs 5 per km. He has a maximum of Rs100 to spend on petrol and travel a maximum distance in one hour time with less pollution. Express this problem as an LPP and solve it graphically. What value do you find here?

 3

Two tailors, A and B earn ₹ 15 and ₹ 20 per day respectively. A can stitch 6 shirts and 4 pants while B can stitch 10 shirts and 4 pants per day. How many days shall each work if it is desired to produce (at least) 60 shirts and 32 pants at a minimum labour cost?

 4

A factory manufactures two types of screws, A and B, each type requiring the use of two machines - an automatic and a hand - operated. It takes 4 minute on the automatic and 6 minutes on the hand - operated machines to manufacture a package of screws ‘A’, while it takes 6 minutes on the automatic and 3 minutes on the hand - operated machine to manufacture a package of screws ‘B’. Each machine is available for at most 4 hours on any day. The manufacturer can sell a package of screws ‘A’ at a profit of 70 P and screws ‘B’ at a profit of ₹ 1. Assuming that he can sell all the screws he can manufacture, how many packages of each type should the factory owner produce in a day in order to maximize his profit? Determine the maximum profit.