Sei sulla pagina 1di 9

# Formulation 1.

Production Allocation problem, A firm manufactures two types of products A& B and sell them at a profit of Rs 2 on type A and Rs 3 on type B. Each product is processed on two machines G and H.Type A requires one minute of processing time on G And two minutes on H, type B requires one minute on G and one on H, the machine G is available for not more Than 6 hour 40 minutes while machine His available for 10 hours during any work day. Formulate the problem As LPP. 2. Dieticians tell us that a balance diet must contain quantities of nutrients such as calories, minerals. Vitamins The medical experts and dieticians tell that is necessary for an adult to consume 75g of proteins, 85g of fats, 300g of carbohydrates daily. The following table gives the food items, analysis, and their respective cost. Construct this problem as LPP to findout the food that should be recommended from a large number of Alternative sources of these nutrients so that the total cost of foot satisfying minimum requirements of Balanced diet is the lowest. 3. A firm manufactures 3 products A, B and C. The profits are Rs 3,Rs2, &Rs4 respectively. The firm has two machines and below is given the required processing time in minutes for each machine on each product. Machin e C D A 4 2 Products B 3 2 C 5 4

Machines C and D have 2,000 and 2,500 machine-minutes respectively. The firm must manufacture 100 As, 200Bs and 50cs but not more than 150 As. Formulate an LPP to maximize profit. 4) The manager of an oil refinery must decide on the optimum mix of 2 possible blending processes of which the inputs and production runs are as follows. Input Out put Process Crude A Crude B Gasoline X Gasoline Y 1 6 4 6 9 2 5 6 5 5 The maximum amounts available of crudes A and B are 250 units and 200 units respectively. Market demand shows that at lest 150 units of gasoline X and 130units of gasoline Y must be produced. The profits per production run from process 1 and 2 are Rs 4 and Rs 5 respectively. Write the mathematical form of this problem for maximizing the profit. 5) A manufacturer produces 2 types of models M1 and M2 .Each M1 model requires 4 hrs of grinding and 2 hrs of polishing, where as each M2 Model requires 2hrs of grinding and 5hrs of polishing. The manufacturer has 2 grinders and 3 polishers. Each grinder works for 40 hrs per week and each polisher works for 60 hrs per week. Profit on M1 model is Rs 3, and on M2 model is Rs 4. What we produced in a week is sold in the market. How should the manufacturer should allocate his production capacity to the two types of models so that he may Make the maximum profit. Write the mathematical form of the given problem. 6. An animal feed company must produce 200 Ibs of a mixture containing ingredients X1, X2,.X1 costs Rs 3 per Ib and X2 costs Rs 8 per Ib. Not more than 80 Ibs of X1 can be used and miximum quantity to be used for X2 is 60 Ibs. Formulate the mathematical form to find how much of each X1,X2 should be used if the company wants to minimize the cost. 7. Old hens can be bought for Rs 2 each but young hens cost Rs 5 each. The old hen lay 3 eggs per week each being worth 30 paise. A hen cost Rs 1 per week to feed. If have only Rs 80 to spend for hens, how many of each Kind should buy to give a profit of more than Rs 6 per week, assuming that I cant house more than 20 hens. Write the mathematical form of the given problem. 8. A manufacturer produces two types of models M1 and M2. Each M1 model requires 4 hrs of grinding and 2 hrs of polishing where as each M2 model requires 2 hrs of grinding and 5 hrs of polishing. The manufacturer has 2

grinders and 3 polisher Each grinder works for 40 hrs per week and each polisher works for 60 hrs per week. Profit on M1 model is Rs 3 and on M2 model is Rs 4. What is produced in a week is sold in the market. How Should the manufacturer should allocate his production capacity to the two types of models. So that he may make the maximum profit write the mathematical form of the given problem. Graphical solution 1) Solve the given LPP Graphically Max Z = 3X1 + 4X2 S . to 4X1 + 2X2 80 2X1 + 5X2 180 X1 + X2 0. 2) Solve the given LPP Graphically. Min Z = 20X1 + 10X2 s.to X1 + X2 40, 3X1 + X2 30 4X1 + 3X2 60 X1,X2 0. 3) Solve the given LPP Graphically. Max Z = 3X1 + 2X2 . s.to X1 X2 1 X1+ X2 3. X1 0, X2 0. . 4) Solve the given LPP Graphically. Min Z = 4X1 + 2X2 S.to X1 + 2X2 2 3X1 + X2 3 4X1 + 3X2 6 X1 X2 0 5) Solve the given LPP Graphically Max Z = X1 + X2 / 2 s.to 3X1 + 2X2 12 5X1 10 X1 + X2 8 - X1 + X2 4 X1, X2 0 6) Solve the LPP graphically Min is Z = X1 + X2 S.to X1 + X2 1 -3X1 + X2 3 X1, X2 0

7) Show graphically the maximum, minimum values of the objective function for the following are same. Z = 5X1 + 3X2 s.to X1 + X2 6 2X1 + 3X2 3 0 < X1 <3, 0 <X2 < 3.

8) Solve the following LPPs graphically. Max Z = 2X2 X1 s.to X1 X2 -1 5X1 + X2 2 X2 2 X1, X2 9) Max Z = 3X1 + 2X2 s.to 2X1 + X2 1, X1 2, X1 + X2 3 X1, X2 0 10) Max Z = 45X1 + 80X2 s.to 5X1 + 20X2 400, 10X1 + 15X2 450 X1, X2 0 11) Max Z = 5X1 + 7X2 s.to X1 + X2 4, 3X1 +8X2 2, 10X1 + 7X2 = 35, X1, X2 0 12) Min Z = 3X1 + 5X2 s.to X1 4,2X2 6, 3X1 + 2X2 18, X1 + X2 9,X1, X2 0

Simplex 1. Using simplex method solve the following LPP. Max Z = X1 + 2X2 s.to - X1 + 2X 2 8 X1 + 2X2 12 X1 2X2 3 X1, X2 0 2. Solve the given LPP using simplex method Max Z = 5X1 + 3X2 s.to X1 + X2 2 5X1 + 2X2 10 3X1 + 8X2 12 X1 , X2 0 3. Solve the LPP using simplex method. Min Z = X1 X2 + X3 + X4 + X5 X6 s.to X1 + X4 + 6X6 = 9 3X1 +X2 4X3 + 2X6 = 2 all Xis 0

4. Solve the given LPP using simplex method. Max Z = 107X1 + X2 + 2X3 s.to 14X1 +X2 6X3 + 3X4 = 7 16X1 + 1/2X2 6X3 5 3X1 X2 X3 0 Xis 0 5. Using simplex method to solve the following LPP Max Z = 3X1 + 2X2 s.to X1 + X2 6, 2X1 + X2 6, X1,X2 0 6. Max Z = X1 + 2X2 + 3X3 S,to X1 2X2 + 3X3 10, X1 + X2 5, X1,X2 , X3 0. 7. Max Z = 5X1 + 2X2 + 3X3 X4 + X5 s.to X1 + 2X2 +2X3 +X4 = 8 3X1 + 4X2 X3 + X5 = 7 X1 ,X2 ,X3 ,X4 ,X5 > 0 8. Max Z = -4X1,-3X2 4X3 6X4 s.toX1 + 2X2 +2X3 + X4 80 2X1 + 2X3 + X4 60 3X1 +3X2 + X3 + X4 < 80 X1,X2,X3,X4, 0 9. Use Big-M method to solve the LPP. Min Z = 4X1 +3X2 s.to 2X1 + X2 10 -3X1 + 2X2 6 X1 + X2 6 X1,X2, 0 10.. Max Z = 5X1-4X2+3X3 s.to2X1 + X2 - 6X3 = 20 6X1 + 5X2 +10 X3 76 8X1 -3X2 +6 X3 50 X1,X2,X3,X4, 0 11. Solve the following LP Problems by two- phase method. Max Z = 3X1 X2 s.to 2X1 + X2 2 X1 + 3X2 2 X2 4 & X1,X2 0 12. Min Z = X1- 2X2 3X3 s.to - 2X1 + X2 + 3X3 = 2 2X1 + 3X2 + 4X3 =1 Xi 0 I = 1,2,3. 13. Max Z = 5X1 + 8X2 s.to 3X1 +2X2 3 X1 + 4X2 4 X1 + X2 5

X1 , X2 0 14. Max Z = 500X1 + 1400X2 + 900X3 s.to X1 + X2 + X3 = 100 12X1+ 35X2 + 15X3 25 8X1 + 3X2 + 4X3 6 X1,X2 ,X3 0 Obtain the dual of the following linear programming problems. 1. Max Z = 3X1+4X2 s.to 2X1+6X2 16 5X1+2X+2X2 20 X1, X2 0 2. Min Z= 7X1+3X2 +8X3 s.to 8X1+2X2 +X1 3 3X1+6X2+4X3 4 4X1+X2+5X3 1 X1+5X2+2X3 7 X1,X2 ,X3 0 3. . Max Z= 3X1+X2 +X3-X4 s.to X1+5X2 +3X3 +4X4 5 X1+X2= -1 X3-X4 -5 X1,X2,X3,X4 0 4. . Min Z= X3+X4 +X5 s.to X1-X3 +X4+X5 = -2 X2-X3-X4+X5= 1 Xi.>0,I=1,25 5. . Max Z= 6X1+4X2 +6X3+X4 s.to 4X1+4X2 +4X3 +8X4=21 3X1+17X2+80X3+2X4 48 X1,X2 , 0 ,X3 ,X4are unrestricted in sign. 6. Max Z = 3X1+2X2 s.to 2X1+X2 5 X1+X2 3 X1+X2 0. 7. . Max Z =2X1+X2 s.to X1+2X2 10 X1+X2 6 X1-X2 2. X1-2X2 1 X1,X2, 0. 8. Min Z =2X1+2X2 s.to 2X1+4X2 1 X1+2X2 1 2X1+X2 1.

X1,X2, 0. 9. Solve the following Assignment problem .A department head four subordinates and four tasks have to be performed. Subordinates differ in efficiency and tasks differ in their intrinsic difficulty. Time each man would take to per form each task is given in the effectiveness matrix. How the tasks should be allocated to each person so as to minimize the total man. Subordinates 1 11 11 IV A 8 26 17 11 B 13 28 4 26 Tasks c 38 19 18 15 19 26 24 10 10. A car hire company has one car at each of five depots a ,b,c,d and e.A customer requires a car in each town, namely A,B,C,D,E.Distance between depots and towns are given in the following distance matix. A 160 135 140 50 55 b 130 120 110 50 35 c 175 130 155 80 70 d 190 160 170 80 80 e 200 175 185 110 105 A B C D E How should cars be assigned to customer so as

to minimize the distance traveled? 11. Solve the assignment problem represented by the following matrix a 9 43 41 74 36 3 b 22 78 28 42 11 56 c 58 72 91 27 57 53 d 11 50 37 49 22 31 e 19 63 45 39 25 17 f 27 48 33 32 18 28

15 31 21 14

work

I 45

II 30

III 65

IV 40

55

B C D E

50 25 35 80

30 20 25 60

25 15 30 60

60 20 30 70

30 40 20 50

## 14. Solve the following Assignment problems. a) W 18 8 J10 1 2 3 4 5 13 11 12 7 9 X 24 13 15 A 13 19 11 15 13 16 26 4 9 12 Y 28 17 19 B 23 16 9 14 8 Z 32 19 22 C 19 17 6 14 14 D 9 18 10 13 11 E A Job B F

Jobs c) Machines
e e 1 2 3 4 5 A 5 2 3 6 7 B 11 4 12 14 9 C 10 9 5 4 8 D 12 3 14 11 12 E 4 5 6 7 5

## d) Solve the following maximization assignment problem.

A B C D E 1 32 48 20 71 52 2 41 54 31 43 29 3 57 62 81 41 51 4 18 34 57 47 50

## A B C D E 1 32 38 40 28 40 2 40 24 28 21 36 3 41 20 33 30 37 4 22 38 41 36 36 5 29 33 40 35 39 A B C D E A 4 7 3 4 B 4 6 3 4 C 7 6 7 5 D 3 3 7 7 E 4 4 5 7 A B C D E A 4 7 3 4 15. Solve the following Travelling salesman peoplem. B 4 6 3 4 C 7 6 7 5 e) D 3 A3 B 7 E 7 C D E 4 4 5 7

A B C D E

2 5 6 3 8 7 12 4 6 1 3 2

7 8 4 8

1 2 7 5

b)
A B C D E A 5 7 10 1 1 6 8 5 5 A 2 6 7 4 2 B B 2 6 3 2 3 12 10 11 7 C C 4 2 5 2 4 6 5 11 8 D 5 4 4 3 5 E D 7 8 4 8 E 1 2 6 4

c)
1 2 3 4 5

d)
A 1 2 3 4 5 32 40 41 22 29 B 38 24 20 38 33 C 40 28 33 41 40 D 28 21 30 36 35 E 40 36 37 36 39

## 16.Find the initial basic feasible solution of following transportation problem.

Ware house W1 W2 W3 W4 Factory capacity Factory 19 30 50 10 7 70 30 40 60 9 40 8 70 20 18 Ware house 5 8 7 14 34 Requirement

By 1) North west corner rule 2) The Row minima method 3) The column minima method 4) Matrix Minima method 5) Vogels Approximation method 17) Determine an initial basic feasible solution to the following TP using north west corner rule.
Avaliable 5 8 6 7 3 Require ment 9 7 4 7 2 3 12 3 5 3 3 4 9 6 6 5 8 5 8 8 8 7 10 7 4 9 10 10 2 6 3 4 14 9 4 4

18) Determine an initial basic feasible solution to the TP by row/Column minima method.
Available 22

15 8 Demand

5 5 7

9 7 12

2 8 17

7 6 9

19) Obtain an initial basic feasible solution to the following TP using matrix minima method.
Capacity 6 Supply 8 4 10 8 Demand 9 Demand

## 20) Determine an IBFS by voges method

1 4 2 0 1 4 3 3 2 3 11 2 4 6 9 3 3 2 10 2 7 8 4 4 3 2 8 5 4 0 7 1 1 6 12 6

21) Godowns
Factory A B C D Demand 1 7 9 11 9 60 2 5 11 10 10 20 3 7 6 6 9 40 4 7 11 2 6 20 5 5 2 9 40 6 3 5 8 12 40 STOCK available 60 20 90 50

Find I) The Initial Basic feasible solution by Vogels method ii) optimal basic feasible solution by modis method. 22.)Obtain an optimum BFS for the following TP
7 4 9 12 5 20 7 3 8 13 4 80 10 8 6 10 5 50 5 6 7 6 6 75 11 13 5 3 12 85 Supply 45 90 95 75 105

Demand

23) Consider four basis of operations Bi and three Targets Tj. The ton of Bombs per aircraft from any base that can br delivered to any target are given in the following Table.
T1 T2 T3 Availability B1 8 6 5 150 B2 6 6 6 150 B3 10 8 4 150 B4 8 6 4 150 Requirment 200 200 200 200

Find the allocation from each base to each target, which maximizes the total over all the three targets.