CHAP 1 Problems:

LINEAR PROGRAMMING

1. A company manufactures radios and calculators. The radios contribute Rs 10 and the calculators Rs 15 to profit. Each radio requires 4 diodes and 4 resistors while each calculator requires 10 diodes and 2 resistors. The radios take 12 minutes and the calculators take 9.6 minutes of time on the companys electronic testing machine while the project manager estimates that 160 hours of test time are available. There are 8000 diodes and 3000 resistors inventory. Formulate this LPP and hence solve graphically. Ans: Graphical Solution: Max z = 10x1 + 15 x2 4x1 + 10x2 8000 4x1 + 2x2 3000 12x1 + 9.6x2 9600 When x1 =0 & x2= 800 x2 = 0 & x1= 2000 Considering 4x1 + 2x2 = 3000 When x1 =0 & x2= 1500 x2 = 0 & x1= 750 Considering 12x1 + 9.6x2 = 9600 x1 =0 & x2= 1000 x2 = 0 & x1= 800 4x1 + 10x2 = 8000 12x1 + 9.6x2 = 9600

Solving the equations simultaneously we get, x2 = 705.88 & x1= 235.3 Max z = 10(235.3) + 15(705.88) Max z = 12941.2

A (750,0) B (610,210)

C (210,710) D (0,800)

2. A farmer has to plant trees of 2 kinds A & B in a land 4400 m2 in area. Tree A requires at least 25 m2 and tree B at least 40 m2 land. The annual water requirement of A is 30 units and B is 15 units per tree, while at most 3300 units of water are available. It is also estimated that the ratio of number of B trees to 6 7 A trees should not be less than /19 and not more than 1 /8. The return per tree from A is expected to be 1.5 times as much as B trees. Formulate as an LPP and solve graphically. Formulation

Tree A Area 25 m2 Water 30 Return 1.5

Tree B 40 m2 15 1.0

Availability 4400 m2 3300 units

Ans: Objective function Let x1 be the no. of A trees. x2 be the no. of B trees. Max z = 1.5x1 + x2 Constraints: STC 30 x1 + 15x2 3300 x2/ x1 6/19 x2/ x1 17/8 x1 , x2 0 Consider 25x1 + 40x2 = 4400 When x1 =0 & When x1 =170 x2 = 110 x2 = 0 Consider 30x1 + 15x2 = 3300 When x1 = 0 & When x1 =110 x2 = 0 x2 =220 19x2 - 6x1 = 0 ( x1=0,

x2 = 0 )

Put x1=100 and x2 = 31.58 8x2 - 17x1 = 0 ( x1=0, x2 = 0 ) x1 = 50, x2 = 106.25 From the graph Point A: x2 = 30, x1 = 94 Max Z = 171 Point B: x2 = 62.5, x1 = 80 Max Z = 182.5 Point C: x2 = 84, x1 = 40 Max Z = 144 Max point is at B 25x1 + 40x2 = 4400 30x1 + 15x2 = 3300 Solving the two equations simultaneously we get, x1=80 & x2 = 60 Max Z = 180

3. A company manufactures washing machines and driers. The manufacturing departments and their monthly capacities are as follows:Department Monthly Washers Capacities Driers Motor&Transmission 16000 7000 Stamping 10000 10000 Assembly line for 9000 _ Washers Assembly line for 900 1000 driers profit If the contribution to profit is Rs 900 per washer & Rs 1000 per drier determine the optimum product mix and profit. Ans: Objective function Let x1 be the no. of washers. x2 be the no. of driers. Max z = 900x1 + 1000x2 x1 16000 x2 7000 STC: x1 + x2 1 16000 7000 x1 + x2 1 10000 10000 x1 9000 x2 5000 Consider, x1 + x2 1 16000 7000 When x1 =0 & When x2 = 7000 x1 = 0 x2 =10000 x2 = 0 x1 =10000

x1 =16000 x2 = 0

x1 = 9000

x2 =5000

To find max Z:From the graph OABCDE represents the solution space At point A x1=9000 x2 =0 Max Z=81, 00000 At point B x1=9000 x2 =2000 Max Z=91, 00000 At point C x1=5400 x2 =4800 Max Z=96, 60,000------(maximum Z) At point D x1=4800 x2 =5000 Max Z=93, 20,000 At point E x2=5000 x1 =0 Max Z=50, 00000 Solving the equations:x1 + x2 = 1 16000 7000 x1 + x2 = 1 10000 10000 i.e. 7000x1 + 16000x2 = 12000000 x1 + x2 = 10000 We get, x1=5333.33 & x2= 4666.66 From the graph @ point C x1=5300 & x2= 4700