Sri Venkateswara College of Engineering, Sriperumbudur Department of Computer Applications

---------------------------------------------------------------------------------

ANNA UNIVERSITY - M.C.A IV SEMESTER Problem Set MC1752/MC9242/600416 Resource Management Techniques
--------------------------------------------------------------------------------UNIT I LINEAR PROGRAMMING MODELS 1. Mathematical Formulation 1. Reddy Mikks Company produces two types of paints: Interior and Exterior paints from two types of raw materials: M1 and M2. problem: Raw Material M1 M2 Profit / ton Tons of raw Material per ton of Exterior paint 6 1 Rs. 5 Interior paint 4 2 Rs. 4 Maximum Daily Availability (tons) 24 6 The following table provides the basic data of the

A market survey indicates that the daily demand for interior paint cannot exceed that for exterior paint by more than 1 ton. Also the maximum daily demand for interior paint is 2 tons. Reddy Mikks wants to determine the optimum product mix of both interior and exterior paints that maximizes the total daily profit. 2. A manufacturer produces two types of product: P1 and P2. Each model must go through two processes: grinding and polishing. The Manufacturer has 2 grinders and 3 polishers. The following table provides the information pertaining to this problem. Processing time (in hours) for Grinding 4 2 40 Hrs. Polishing 2 5 60 Hrs. Rs. 3.00 Rs. 4.00 Profit / unit

Product Types P1 P2 Availability

How should the manufacturer allocate his production capacity to the two types of products so that he may make the maximum profit in a week?

3. A Leather company produces two types of belts: A and B. Each belt type is processed on two machines: G and H. The following table provides the information pertaining to this problem. Determine how many belts of each type the company should produce each day in order to get maximum profit. Belt Types A B Availability Processing time (in minutes) on Machine G 1 1 6 Hrs 40 Mts. Machine H 2 1 10 Hrs. Profit / Belt Rs. 2.00 Rs. 3.00

4. Old hens can be bought for Rs. 2 each but young ones cost Rs. 5 each. The old hens lay 3 eggs per week and the young ones, 5 eggs per week, each being worth 30 paise. A hen costs Rs. 1 per week to feed. If I have only Rs. 80 to spend for hens, how many of each kind should I buy to get a profit of more than Rs. 6 per week, assuming that I cannot house more than 20 hens. 5. A manufacturer has three machines A, B and C with which he produces three different articles P, Q and R. The following table shows the required time for processing. Determine the number of different articles which should be made in order to maximize the profit. Processing time (in hours) on the Machine A 8 2 3 250 Hrs. B 4 3 0 150 Hrs. C 2 0 1 50 Hrs. Profit / Unit Rs. 20 Rs. 6 Rs. 8

Articles P Q R Availability

6. A small-scale manufacturer has producing facilities for producing two different products. Each product requires three different operations: grinding, assembly and testing. Product I requires 15, 20 and 10 minutes and Product II requires 7.5, 40 and 45 minutes respectively for grinding, assembly and testing. The production run calls for at least 7.5 hours of If grinding, at least 20 hours of assembly time and at least 15 hours of testing time.

product I costs Rs. 60 and product II costs Rs. 90 to manufacture, determine the number of units of each product the firm should produce in order to minimize the total cost of operations.

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

7. A manufacturer of furniture makes chairs and tables. They are processed on two machines: A and B. The following table provides the information pertaining to this problem. Determine how many chairs and tables, the company should produce each day in order to get maximum profit. Processing time (in hours) on Machine A 2 5 15 Machine B 6 0 30 Profit / Unit Rs. 1.00 Rs. 5.00

Product Chair Table Availability

8. Two grades of paper M and N are produced on a paper machine. Due to the limitations on the availability of raw material, not more than 400 tonnes of grade M and 300 tonnes of grade N can be produced in a week. It requires 0.2 and 0.4 hours to produce a tonne of products M and N respectively, with corresponding profits of Rs. 20 and Rs. 50 per tonne. Determine the optimum product mix that maximizes the profit. 9. The ABC Company combines factors X and Y to form a product which must weigh 50 Kgs. At least 20 Kgs. of X and no more than 40 Kgs. of Y can be used. The cost of X is Rs. 10 per Kg. and that of Y is Rs. 25 per Kg. Determine the amount of factors X and Y which should be used to minimize the total costs. 10. A production manager wants to determine the quantity to be produced per month of products A snd B manufactured by his firm. The data on resources required and availability of resources are given below. Find the product mix that would give maximum profit. Requirements Resources Raw material (Kg.) Machine hours (piece) Assembly man hours Sale Price / piece Product A 60 8 3 Rs. 30 Product B 120 5 4 Rs. 40 Maximum per month 12000 600 500

11. Two spare parts X and Y are to be produced in a batch. Each one has to go through two processes A and B. The time required in hours per unit and total time available is given below. Find how many unit of spare parts of X and Y are to be produced in this batch to maximize the profit.

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

Spare Part X Y Availability

Process Time (in hours) for Process A 3 4 24 Process B 9 4 36

Profit / Unit Rs. 5.00 Rs. 6.00

12. A company is manufacturing two products A and B, involving three departments. following table. Determine the optimum product mix to maximize the profit. Processing time (in hours) on the department Machining 1 2 720 Hrs. Fabrication 5 4 1800 Hrs. Assembly 3 1 900 Hrs. Profit / Unit Rs. 80 Rs. 100

The

process time, profit earned per unit and the total capacity of each department is given in the

Products A B Availability

13. A firm can produce three types of cloths A, B and C. Three kinds of wool are required for it red, green and blue. The availability and requirement of raw material and profit details are as follows. Determine the optimum production schedule. Cloths Type A B C Availability Raw Material (wool) Required (in yards) Red wool 2 3 0 8 Yards Green wool 0 2 5 10 Yards Blue wool 3 2 4 15 Yards The Profit/Unit of length Rs. 3 Rs. 5 Rs. 4

14. A manufacturer makes 2 products P1 and P2 using two machines: M1 and M2. following table provides the information pertaining to this problem. daily product mix to optimize the profit? Processing time (in hours) on Machine M1 2 5 16 Machine M2 6 0 30 Profit / Unit Rs. 2 Rs. 10

What should be the

Product P1 P2 Availability

15. A company is manufacturing two products A and B, involving three departments. following table. Determine the optimum product mix to maximize the profit.

The

process time, profit earned per unit and the total capacity of each department is given in the

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

Products A B Availability

Processing time (in hours) on the department Dept. 1 2 2 160 Dept. 2 1 2 120 Dept. 3 4 2 280

Profit / Unit Rs. 1.00 Rs. 1.50 (Hrs. /week)

16. A company produces three types of food products F1, F2 and F3 for which is uses three types of vitamins A, C and D. The daily requirement of vitamins with cost per unit is shown below. Determine the best combination of food for minimum cost. Vitamin Required for food Type (in Mgs) F1 1 100 10 1 Mg. F2 1 10 100 50 Mgs. F3 10 10 10 10 Mgs. Cost / Unit Rs. 10 Rs. 15 Rs. 5

Vitamins A C D Requirement

17. A manufacturer makes 3 products A, B and C using two machines: Cutting and Welding. The following table provides the information pertaining to this problem. much of each product must be produced to realize maximum profit. Processing time (in hours) on Cutting M/C 9 5 20 400 / week Welding M/C 11 18 6 750 / week Profit / Unit Rs. 32 Rs. 20 Rs. 60 Determine how

Products A B C Availability

18. A firm makes two products X and Y, and has a total production capacity of 9 tonnes per day, X and Y requiring the same production capacity. The firm has a permanent contract to supply at least 2 tonnes of X and at least 3 tonnes of Y per day to another company. Each tonne of X requires 20 machine hours production time and each tonne of Y requires 50 machine hours of production time. The daily maximum possible number of machine hours is 360. All the firms output can be sold and the profit made is Rs. 80 per tonne of X and Rs. 120 per tonne of Y. It is required to determine the production schedule for maximizing profit and to calculate this profit.

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

19. One unit of product A contributes Rs. 7 and requires 3 units of raw material and 2 hours of labour. One unit of product B contributes Rs. 5 and requires 1 unit of raw material and 1 hours of labour. Availability of raw material at present is 48 units and there are 40 hours of labour. Formulate this problem as a Linear Programming Problem. 20. A furniture company can produce four types of chairs. Each chair must go through two

types of processes: Carpentry shop and finishing shop. Man hours required for each process, available man hours and profit per chair are shown in the table below. Determine the number of chairs in each type to be produced to get maximum profit. Type of Chair C1 C2 C3 C4 Availability of Man Hours Processing time (in hours) on Carpentry Shop 4 9 7 10 6000 / week Finishing Shop 1 1 3 40 4000 / week Profit / Chair Rs. 12 Rs. 20 Rs. 18 Rs. 40

2. Graphical Solution of Linear Programming Models Solve the Following Linear Programming Problems by graphical method. 1. Maximize Z = 5x1 + 4x2 Subject to the constraints 6x1 + 4x2 24 x1 + 2x2 6 - x1 + x 2 1 x2 2 and x1, x2 0 (Ans: x1= 3, x2 =1.5 and Max Z = 21) 3. Maximize Z = 2x1 + 3x2 Subject to the constraints x1 + x2 400 2x1 + x2 600 and x1, x2 0 (Ans: x1= 0, x2 = 400 and Max Z = 1200) 4. Maximize Z = x1 + 5x2 Subject to the constraints 2x1 + 5x2 15 6x1 30 and x1 , x2 0 (Ans: x1= 0, x2 = 3 and Max Z = 15) 2. Maximize Z = 3x1 + 4x2 Subject to the constraints 4x1 + 2x2 80 2x1 + 5x2 180 and x1, x2 0 (Ans: x1= 2.5, x2 =3.5 and Max Z = 147.5)

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

5.

Minimize Z = 60x1 + 90x2 Subject to the constraints 15x1 + 7.5x2 7.5 20x1 + 40x2 20 10x1 + 45x2 15 and x1, x2 0

6.

Minimize Z = 10x1 + 25x2 Subject to the constraints x1 + x2 50 x1 20 x2 40 and x1, x2 0

(Ans: x1= 0.33, x2 = 0.33 and Min Z = -50) 7. Maximize Z = 20x1 + 50x2 Subject to the constraints 0.2x1 + 0.4x2 56 x1 400 x2 300 and x1, x2 0 (Ans: x1= 0, x2 = 140 and Max Z = 7000) 9. Maximize Z = 30x1 + 40x2 Subject to the constraints 60x1 + 120x2 12000 8x1 + 3x1 + 11. 5x2 4x2 600 500 and x1, x2 0

(Ans: x1= 20, x2 = 0 and Min Z = -200) 8. Maximize Z = 5x1 + 6x2 Subject to the constraints 3x1 + 4x2 24 9x1 + 4x2 36 and x1, x2 0 (Ans: x1= 2, x2 = 4.5 and Max Z = 37) 10. Maximize Z = 8x1 + 100x2 Subject to the constraints x1 + 2x2 3x1 + x2 12. 720 900 and x1, x2 0 5x1 + 4x2 1800 (Ans: x1= 0, x2 = 360 and Max Z = 36000) Maximize Z = x1 + 1.5x2 Subject to the constraints 2x1 + 2x2 160 x1 + 2x2 120 4x1 + 2x2 14. 280 and x1, x2 0 (Ans: x1= 40, x2 = 40 and Max Z = 100) Maximize Z = 4x1 + 10x2 Subject to the constraints 2x1 + x2 50 2x1 + 5x2 100 2x1 + 3x2 90 and x1, x2 0 (Ans: x1= 0, x2 = 20 and Max Z = 200) 16. Maximize Z = x + 3y Subject to the constraints x + 2y 10 0x5 0y4 x, y 0 (Ans: x=2 , y =4 and Max Z =14 )

(Ans: x1= 18.18, x2 = 90.91 and Max Z = 4181.82) Maximize Z = 2x1 + 10x2 Subject to the constraints 2x1 + 5x2 16 6x1 30 and x1, x2 0 (Ans: x1= 0, x2 = 3.2 and Max Z = 32) 13. Maximize Z = 7x1 + 5x2 Subject to the constraints x1 + 2x2 6 4x1 + 3x2 12 and x1, x2 0 (Ans: x1= 3, x2 = 0 and Max Z = 21) 15. Maximize Z = 4x + 10y Subject to the constraints 2x + y 50 2x + 5y 100 2x + 3y 90 and x, y 0 (Ans: x=0 , y = 20 and Max Z =200 )

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

17.

Maximize Z = 5x1 + 4x2 Subject to the constraints 4x1 + 5x2 10 3x1 + 2x2 9 8x1 + 3x2 12 and x1, x2 0

18.

Maximize Z = 6x1 + 4x2 Subject to the constraints -2x1 + x2 2 x1 - x 2 2 3x1 + 2x2 9 and x1, x2 0

(Ans: x1= 1.07, x2 =1.14 and Max Z = 9.93) 19. Maximize Z = 2x1 + x2 Subject to the constraints x1 + 2x2 10 x1 + x1 x2 6 x2 2

(Ans: x1=2.6 , x2 = 0.6 and Max Z =18 ) 20. Maximize Z = 4x1 + 5x2 Subject to the constraints x1 - 2x2 2 2x1 + x2 6 x1 + 2x2 5 -x1 + 22. x2 2 and x1, x2 0 (Ans: x1=2.33 , x2 =1.33 and Max Z =16 ) Maximize Z = 2x1 + 3x2 Subject to the constraints x1 + x2 30 x1 - x2 0 x2 3 0 x1 20 0 x2 12 and x1, x2 0 (Ans: x1=18 , x2 =12 and Max Z =72 )

x1 - 2x2 1 and x1, x2 0 (Ans: x1=4 , x2 =2 and Max Z =10 ) 21. Maximize Z = 400x1 + 100x2 Subject to the constraints 2x1 + x2 800 5x1 + 2x2 2400 9x1 + 3x2 3200 and x1, x2 0 (Ans: x1=355.56 , x2 =0 and Max Z =142222.22 )

23.

Minimize Z = 20x1 + 10x2 Subject to the constraints x1 + 2x2 40 3x1 + x2 30 4x1 + 3x2 60 and x1, x2 0

24.

Maximize Z = 7x1 + 3x2 Subject to the constraints x1 + 2x2 3 x1 + x2 4 0 x1 5/2 0 x2 3/2 and x1, x2 0

(Ans: x1= 6, x2 =12 and Min Z = 240) 25. Minimize Z = 3x1 + 2x2 Subject to the constraints 5x1 + x2 10 x1 + x2 6 x1 + 4x2 12 and x1, x2 0 (Ans: x1= 1, x2 =5 and Min Z = 13) 27. Maximize Z = 15x1 + 10x2 Subject to the constraints 4x1 + 6x2 360 3x1 180 5x2 200 and x1, x2 0 (Ans: x1=60, x2 = 20 and Max Z =1100 ) 28. 26.

(Ans: x1=5/2 , x2 =3/2 and Max Z =22 ) Maximize Z = 2x1 + x2 Subject to the constraints x1 + 2x2 10 x1 + x1 x2 6 x2 2

x1 - 2x2 1 and x1, x2 0 (Ans: x1=4 , x2 =2 and Max Z =10 ) Maximize Z = 7x1 + 5x2 Subject to the constraints 3x1 + x2 48 2x1 + x2 40 and x1, x2 0 (Ans: x1=0 , x2 =40 and Max Z =200 )

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

3. Simplex Method

Solve the following LPP by Simplex Method:

1. Maximize Z = 5x1 + 4x2 Subject to the constraints 6x1 + 4x2 24 x1 + 2x2 6 - x1 + x 2 1 x2 2 and x1, x2 0 (Ans: x1= 3, x2 =1.5 and Max Z = 21) 3. Maximize Z = 2x1 + 3x2 Subject to the constraints x1 + x2 400 2x1 + x2 600 and x1, x2 0 (Ans: x1= 0, x2 = 400 and Max Z = 1200) 5. Maximize Z = x1 - x2 + 3x3 Subject to the constraints x1 + x2 + x3 10 2x1 x3 2 2x1 - 2x2 + 3x3 0 x1, x2, x3 0 (Ans: x1= , x2 = , x3 = and Max Z = ) 7. Maximize Z = 20x1 + 50x2 Subject to the constraints 0.2x1 + 0.4x2 56 x1 400 x2 300 and x1, x2 0 (Ans: x1= 0, x2 = 140 and Max Z = 7000) 9. Maximize Z = 30x1 + 40x2 Subject to the constraints 60x1 + 120x2 12000 8x1 + 3x1 + 4181.82) 5x2 600 4x2 500 and x1, x2 0 = 90.91 and Max Z = 10. 8. 6. 4. Maximize Z = x1 + 5x2 Subject to the constraints 2x1 + 5x2 15 6x1 30 and x1 , x2 0 (Ans: x1= 0, x2 = 3 and Max Z = 15) Maximize Z = 2x + 4y + 3z Subject to the constraints 3x + 4y + 2z 60 2x + y + 2z 40 x + 3y + 2z 80 x, y, z 0 (Ans: x= , y= , z= and Max Z = ) Maximize Z = 5x1 + 6x2 Subject to the constraints 3x1 + 4x2 24 9x1 + 4x2 36 and x1, x2 0 (Ans: x1= 2, x2 = 4.5 and Max Z = 37) Maximize Z = 8x1 + 100x2 Subject to the constraints x1 + 2x2 3x1 + x2 720 900 and x1, x2 0 5x1 + 4x2 1800 (Ans: x1= 0, x2 = 360 and Max Z = 36000) 2. Maximize Z = 3x1 + 4x2 Subject to the constraints 4x1 + 2x2 80 2x1 + 5x2 180 and x1, x2 0 (Ans: x1= 2.5, x2 =3.5 and Max Z = 147.5)

(Ans: x1= 18.18, x2

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

10

11.

Maximize Z = 2x1 + 10x2 Subject to the constraints 2x1 + 5x2 16 6x1 30 and x1, x2 0

12.

Maximize Z = x1 + 1.5x2 Subject to the constraints 2x1 + 2x2 160 x1 + 2x2 120 4x1 + 2x2 280 and x1, x2 0

(Ans: x1= 0, x2 = 3.2 and Max Z = 32) 13. Maximize Z = 7x1 + 5x2 Subject to the constraints x1 + 2x2 6 4x1 + 3x2 12 and x1, x2 0 (Ans: x1= 3, x2 = 0 and Max Z = 21) 15. Maximize Z = 4x + 10y Subject to the constraints 2x + y 50 2x + 5y 100 2x + 3y 90 and x, y 0 (Ans: x=0 , y = 20 and Max Z =200 ) 17. Maximize Z = 5x1 + 4x2 Subject to the constraints 4x1 + 5x2 10 3x1 + 2x2 9 8x1 + 3x2 12 and x1, x2 0 (Ans: x1= 1.07, x2 =1.14 and Max Z = 9.93) 19. Maximize Z = 2x1 + x2 Subject to the constraints x1 + 2x2 10 x1 + x1 x2 6 x2 2

(Ans: x1= 40, x2 = 40 and Max Z = 100) 14. Maximize Z = 4x1 + 10x2 Subject to the constraints 2x1 + x2 50 2x1 + 5x2 100 2x1 + 3x2 90 and x1, x2 0 (Ans: x1= 0, x2 = 20 and Max Z = 200) 16. Maximize Z = x + 3y Subject to the constraints x + 2y 10 0x5 0y4 x, y 0 (Ans: x=2 , y =4 and Max Z =14 ) 18. Maximize Z = 6x1 + 4x2 Subject to the constraints -2x1 + x2 2 x1 - x 2 2 3x1 + 2x2 9 and x1, x2 0 (Ans: x1=2.6 , x2 = 0.6 and Max Z =18 ) 20. Maximize Z = 4x1 + 5x2 Subject to the constraints x1 - 2x2 2 2x1 + x2 6 x1 + 2x2 5 -x1 + 22. x2 2 and x1, x2 0 (Ans: x1=2.33 , x2 =1.33 and Max Z =16 ) Maximize Z = 3x1 + 2x2 - 2x3 Subject to the constraints x1 + 2x2 + 2x3 10 2x1 + 4x2 + 3x3 15 x1 , x2 , x 3 0

x1 - 2x2 1 and x1, x2 0 (Ans: x1=4 , x2 =2 and Max Z =10 ) 21. Maximize Z = 400x1 + 100x2 Subject to the constraints 2x1 + x2 800 5x1 + 2x2 2400 9x1 + 3x2 3200 and x1, x2 0 (Ans: x1=355.56 , x2 =0 and Max Z =142222.22 )

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

11

23.

Maximize Z = 30x1 + 23x2 + 29x3 Subject to the constraints 6x1 + 5x2 + 3x3 4x1 + 2x2 + 5x3 26 7

24. 40x4

Maximize Z = 12x1 + 20x2 + 18x3 + Subject to the constraints 4x1 + 9x2 + 7x3 + 10x4 6000 x1 + x2 + 3x3 + 40x4 4000 and x1, x2, x3, x4 0

(Ans: x1=4000/3, x2= x3=0, x4=200/3 and Max Z =56000/3 )

**25. Maximize Z = 3x1 + 9x2 Subject to the constraints x1 + 4x2 8 x1 + 2x2 4 x1, x2 0 (Degenerate Solution) **27. Maximize Z = 2x1 + x2 Subject to the constraints x1 - x2 10 2x1 40 x1, x2 0 (Unbounded Solution)

**26. Maximize Z = 2x1 + 4x2 Subject to the constraints x1 + 2x2 5 x1 + x2 4 x1 , x 2 Solutions) **28. Maximize Z = 3x1 + 2x2 Subject to the constraints 2x1 + x2 2 3x1 + 4x2 12 x1, x2 0 (Infeasible Solution) 0 (Alternative or infinite

4. Simplex Method Artificial Variable Technique

Solve the following LPP by Big-M Method or Artificial Variable Method or Cost- Penalty Method or Charnes penalty method:
1. Minimize Z = x1 + x2 Subject to the constraints 2x1 + 4x2 4 x1 + 7x2 7 and x1, x2 0 (Ans: x1= 21/13, x2 =10/13 and Min Z = 31/13) 3. Minimize Z = 5x1 + 3x2 Subject to the constraints 2x1 + 4x2 12 2x1 + 2x2 = 10 5x1 + 2x2 10 and x1, x2 0 (Ans: x1= 4, x2 = 1 and Min Z = 23) 4. Maximize Z = x1 + 2x2 +3x3 x4 Subject to the constraints x1 + 2x2 + 3x3 2x1 + x2 + 5x3 x3, x4 0
(Ans: x1=15/6, x2 =15/6, x3 =15/6, x4=0 and Max Z = 15)

2.

Minimize Z = x1 - 2x2 - 3x3 Subject to the constraints -2x1 + 3x2 + 3x3 = 2 2x1 + 3x2 + 4x3 = 1 and x1,

x2, x3 0 (Ans: No feasible Solution exists)

= 15 = 20

x1 + 2x2 + x3 + x4 = 10 and x1, x2,

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

12

5.

Minimize Z = 600x1 + 500x2 Subject to the constraints 2x1 + x2 80 x1 + 2x2 60 and x1, x2 0

6.

Minimize Z = 2x + y Subject to the constraints 3x + y 3 4x + 3y 6 x + 2y 3 and x, y 0

(Ans: x1= 100/3, x2 80,000/3) 7.

=40/3 and Min Z =

(Ans: x=3/5, y=6/5 and Min Z = 12/5) 8. Minimize Z = 4x1 + 2x2 Subject to the constraints 3x1 + x2 27 x1 + x2 21 x1 + 2x2 30 and x1, x2 0 (Ans: x1= , x2 = and Min Z = )

Maximize Z = 3x1 + 2x2 +3x3 Subject to the constraints 2x1 + x2 + x3 2 3x1 + 4x2 + 2x3 8 x1, x2, x3 0

(Ans: x1=0, x2 =2, x3 =0 and Max Z = 4) 6. Minimize Z = 4x + y Subject to the constraints 3x + y = 3 4x + 3y 6 x + 2y 4 and x, y 0 (Ans: x=2/5, y=9/5, and Min Z = 17/5)

5. Variants of Simplex Method Two Phase Method

Solve the following LPP by Two-Phase Method:

1. Minimize Z = 7.5x1 - 3x2 Subject to the constraints 3x1 - x2 - x3 3 x1 x3 0 (Ans: x1= 5/4, x2 = x3 = 0 and Min Z = 75/8) 3. Maximize Z = 2x1 + 3x2+ 5x3 Subject to the constraints 3x1 + 10x2 + 5x3 15 33x1 - 10x2 + 9x3 33 x1 + x 2 + x 3 0 4 and x1, x2, x2 4. x2 + x3 2 and x1, x2, 2. Minimize Z = 4x + y Subject to the constraints 3x + y = 3 4x + 3y 6 x + 2y 4 and x, y 0 (Ans: x=2/5, y=9/5, and Min Z = 17/5) Minimize Z = 6x1 + 21x2 Subject to the constraints x1 + 2x2 3 x1 + 4x2 4 and x1, x2 0

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.

13

6. Variants of Simplex Method Duality Write the dual of the following primal LPP: Try to solve the dual problem and obtain the solution of the given primal from the Dual problem by simplex method. 1. Maximize Z = 2x1 + x2 Subject to the constraints x1 + 2x2 10 x1 + x 2 6 x1 x2 2 x1 - 2x2 1 and x1, x2 0 (Ans: w1= 0, w2 =3/2, w3 =1/2, w4 =0 and Min Z* = 10) (Ans: x1= 4, x2 =2 and Max Z = 10) 3. Maximize Z = 3x1 + 4x2 Subject to the constraints x1 - x2 1 x1 + x2 4 x1 - 3x2 3 and x1, x2 0 (Ans: x1= , x2 = and Max Z = ) 5. Maximize Z = 15x1 + 10x2 Subject to the constraints 3x1 + 5x2 5 5x1 + 2x2 3 and x1, x2 0 (Ans: x1=, x2 = and Max Z =) 7. Maximize f(x) = 6x + 5y + 2z Subject to the constraints x + 3y + 2z 5 2x + 2y + z 2 4x 2y + 3z -1 and x, y, z 0 8. Maximize Z = 3x + 5y + 4z Subject to the constraints 2x + 3z 8 5y + 4z 15 and x, y, z 0 5x + 2y + 2z 10 x3 0 6. Minimize Z = 2x1 + 9x2 +x3 Subject to the constraints x1 + 4x2 + 2x3 5 3x1 + x2 + 2x3 4 and x1, x2, x3 0 4. Maximize Z = 30x1 + 23x2 +29x3 Subject to the constraints 6x1 + 5x2 + 3x3 26 4x1 + 2x2 + 5x3 7 and x1, x2, 2. Maximize Z = w1 + w2 + w3 Subject to the constraints 2w1 + w2 + 2w3 2 4w1 + 2w2 + w3 2 w1 , w2 , w3 0

9. A company produces three products P, Q and R from three raw materials: A, B and C. One unit of P requires 2 units of A and 3 units of B. One unit of Q requires 2 units if B and 5 units of C and one unit of product R require 3 units of A, 2 units of B and 4 units of C. The company has 8 units of material A, 10 units of material B and 15 units of material C available to it. Profit per unit of products P, Q and R are Rs. 3, Rs. 5, and Rs. 4 Respectively. (a) Formulate the problem as a mathematical model. (b) How many units of each product should be produced so as to maximize the profit? (c) Write the dual problem.

Prepared by S Raju / Associate Professor / Dept. of CA / S.V.C.E.