Q12 of 118 Page 31

A firm manufactures two products A and B. Each product is processed on two machines M1 and M2. Product A requires 4 minutes of processing time on M1 and 8 min. on M2; product B requires 4 minutes on M1 and 4 min. on M2. The machine M1 is available for not more than 8 hrs 20 min. while machine M2 is available for 10 hrs. during any working day. The products A and B are sold at a profit of ₹ 3 and ₹ 4 respectively.Formulate the problem as a linear programming problem and find how many products of each type should be produced by the firm each day in order to get maximum profit.

Let required production of product A and B be x and y respectively.


Since profit on each product A and B are Rs. 3 and Rs. 4 respectively. So, profits on x number of type A and y number of type B are 3x and 4y respectively.


Let Z denotes total output daily, so,


Z = 3x + 4y


Since, each A and B requires 4 minutes each on machine . So, x of type A and y of type B require 4x and 4y minutes respectively. But,


Total time available on machine is 8 hours 20 minutes = 500 minutes.


So,


4x + 4y 500


x + y 125 {First Constraint}


Since, each A and B requires 8 minutes and 4 minutes on machine respectively. So, x of type A and y of type B require 8x and 4y minutes respectively. But,


Total time available on machine is 10 hours = 600 minutes.


So,


8x + 4y 600


2x + y 150 {Second Constraint}


Hence mathematical formulation of the given LPP is,


Max Z = 3x + 4y


Subject to constraints,


x + y 125


2x + y 150


x,y 0 [Since production of A and B can not be less than zero]


Region x + y 125: line x + y = 125 meets the axes at A(125,0), B(0,125) respectively.


Region containing the origin represents x + y 125 as origin satisfies x + y 125.


Region 2x + y 150: line 2x + y = 150 meets the axes at C(75,0), D(0,150) respectively.


Region containing the origin represents 2x + y 150 as origin satisfies 2x + y 150.


Region x,y 0: it represents the first quadrant.


12.jpg


The corner points are O(0,0), B(0,125), E(25,100), and C(75,0).


The vaues of Z at these corner points are as follows:



The maximum value of Z is 500 which is attained at B(0,125).


Thus, the maximum profit is Rs 500 obtained when no units of product A and 125 units of product B are manufactured.


More from this chapter

All 118 →
10

A manufacturer of Furniture makes two products : chairs and tables. Processing of these products is done on two machines A and B. A chair requires 2 hrs on machine A and 6 hrs on machine B. A table requires 4 hrs on machine A and 2 hrs on machine B . There are 16 hrs of time per day available on machine A and 30 hrs on machine B. profit gained by the manufacturer from a chair and a table is ₹ 3 and ₹ 5 respectively. Find with the help of graph what should be the daily production of each of the two products so as to maximize his profit.

 11

A furniture manufacturing company plans to make two products : chairs and tables. From its available resources which consists of 400 square feet of teak wood and 450 man hours. It is known that to make a chair requires 5 square feet of wood and 10 man - hours and yields a profit of ₹ 45, while each table uses 20 square feet of wood and 25 man - hours and yields a profit of ₹ 80. How many items of each product should be produced by the company so that the profit is maximum?

 13

A firm manufacturing two type of electric items, A and B, can make a profit of 20 per unit of A and ₹ 30 per unit of B. Each unit of A requires 3 motors and 4 transformers and each unit of B requires 2 motors and 4 transformers. The total supply of these per month is restricted to 210 motors and 300 transformers. Type B is an export model requiring a voltage stabilizer which has a supply restricted to 65 units per month. Formulate the linear programming problem for maximum profit and solve it graphically.

 14

A factory uses three different resources for the manufacture of two different products,20 units of the resources a, 12 units of B and 16 units of C being available 1 unit of the first product requires 2,2 and 4 units of the respective resources and 1 unit of the second product requires 4,2 and 0 units of respective resources. It is known that the first product gives a profit of 2 monetary units per unit and the second 3. Formulate the linear programming problem. How many units of each product should be manufactured for maximizing the profit? Solve it graphically.