Solveeit Logo

Question

Mathematics Question on Linear Programming Problem

A factory owner wants to purchase two types of machines, AA and BB, for his factory. The machine AA requires an area of 1000m21000 m^2 and 1212 skilled men for running it and its daily output is 50 50 units, whereas the machine BB required 1200m21200m^ 2 area and 88 skilled men, and its daily output is 4040 units. If an area of 7600m27600 m^2 and 7272 skilled men be available to operate the machine, how many machines AA and BB respectively should be purchased to maximize the daily output?

A

4,34,3

B

2,62,6

C

6,26,2

D

3,43, 4

Answer

4,34,3

Explanation

Solution

Let the number of machine AA be xx and number of machine BB be yy. Let zz be the daily output. Now given information can be summarized as : According to question, xx and yy must satisfy the following conditions: (Area) 1000x+1200y76005x+67381000x + 1200y \le 7600 \Rightarrow 5x + 67 \le 38 (Man power) 12x+87723x+271812 x + 87 \le 72 \Rightarrow 3x + 27 \le 18 x0,y0 x \ge 0,y \ge 0 Mathematical formulation of the LPPLPP is Maximize z=50x+40yz = 50x + 40y subject to constraints : 5x+6738,3x+2718,x0,y05x + 67 \le 38,3x + 27 \le 18, x\ge 0, y \ge 0 Now, we draw the lines l1:5x+67=38l_1 : 5x + 67 = 38 l2:3x+2y=18 l_2: 3x + 2y= 18 l3:x=0 l_3 : x = 0 and l4:7=0l_4 :7 = 0 Lines l1l_1 and l2l_2 meet at E(4,3)E(4, 3). The shaded region OCEBOCEB is the feasible region which is bounded. Vertices of the feasible region are 0(0,0),C(6,0),E(4,3)0(0,0), C(6,0), E(4,3) and B(0,193)B\left(0, \frac{19}{3}\right) Maximize z=50x+40yz = 50x + 40y At 0,z=50×0+40×0=00, z = 50 \times 0 + 40 \times 0 = 0 At C,z=50×6+40×0=300C, z = 50 \times 6 + 40 \times 0 = 300 At E,z=50×4+40×3=320E,z= 50 \times 4 + 40 \times 3 = 320 At B,z=50×0+40×193=253.33B, z = 50 \times 0 + 40 \times {\frac{19}{3}} = 253.33 Clearly, the maximum output =320= 320 is at E(4,3)E(4, 3), i.e., when 44 machines AA and 33 machines BB are purchased.