1. Solve graphically Max. Z = 2 x1 + x2 , s.t. x1 + 2 x2 10 x1 + x2 6 x1 x2 2 x1 2 x2 1 and x1 , x2 0. 2. Solve graphically Min.Z = 20 x1 + 10 x2 s.t. x1 + 2 x2 40 3 x1 + x2 30 4 x1 + 3 x2 60 & x1 , x2 0 3.

, x2 0 3. A company makes two kinds of leather belts. Belt A is a high quality belt and belt B is of lower quality. The respective profits are Rs. 4 and Rs. 3 per belt. The production of each of type A requires twice as much time as a belt of type B, and if all belts were of type B, the company could make 1000 per day. The supply of leather is sufficient for only 800 belts per day (both A and B combined). Belts A requires a fancy buckle and only 400 per day are available. There are only 700 buckles a day available for belt B. What should be the daily production of each type of belt? Formulate this problem as an LP model and solve it by simplex method. 4. Solve Min.Z = 3 x1 + 2 x2 s.t. 5 x1 + x2 10 2 x1 + 2 x2 12 x1 + 4 x2 12 & x1 , x2 0 5. Solve using Assignment Problem Surplus Cities A B C D E

a 160 135 140 50 55

Deficit cities b c 130 115 120 130 110 125 50 80 35 80

d 190 160 170 80 80

e 200 175 185 110 105

6. Find the sequence that minimizes the total elapsed time required to complete the following jobs on machines A, B and C in order ABC. Processing time are given below in the table.

Jobs Machine A Machine B Machine C

1 8 5 4

2 10 6 9

3 6 2 8

4 7 3 6

5 11 4 5

7. Solve the following game by using dominance property Player B B1 B2 B3 B4 B5 B6 Player A1 4 2 0 2 1 1 A A2 4 3 1 3 2 2 A3 4 3 7 -5 1 2 A4 4 3 4 -1 2 2 A5 4 3 3 -2 2 2 8. A project schedule has the following characteristic Activity 1- 1- 2- 2- 3- 4- 4- 5- 62 3 4 6 4 5 6 7 7 Time(Days) 1 1 1 1 1 7 1 1 9 0 1 3 4 0 7 3 Manpower/ 2 3 4 3 1 3 5 3 8 Day 78 1 11

Construct a network diagram and find out total float and free float for each activity. The contractor stipulates that during the first 26 days only 4 to 5 men and during remaining days 8 to 11 men only can be made available. Re-arrange the activities suitable for levelling the manpower resources, satisfying the above condition. 9. A project schedule has the following characteristic Activity 1- 1- 2- 3- 3- 4- 5- 5- 6- 7- 8- 92 3 4 4 5 9 6 7 8 8 1 10 0 Time(Da 4 1 1 1 6 5 4 8 1 2 5 7 ys)

Construct a network diagram. Compute the earliest event time and latest event time. Determine the critical path and total project duration Compute total float and free float for each activity.