LPP problems 1.

Production Allocation Problem: A firm manufactures two types of products A and B and sells 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 minute on H. The machine G is available for not more than 6 hour 40 minutes while machine H is available for 10 hours during any working day. Formulate the problem as a linear programming problem. 2. A company produces two types of hats. Each hat of the first type requires twice a much labour time as the second type. If all hats are of the second type only, the company can produce a total of 500 hats a day. The market limits daily sales of the first and second type to 150 and 250 hats. Assuming that the profits per hat are Rs .8 for type A and Rs.5 for type B, formulate the problem as a linear programming model in order to determine the number of hats to be produced of each type so as to maximize the profit. 3. The manufacturer of patent medicines is proposed to prepare a production plan for medicines A and B. There are sufficient ingredient available to make 20,000 bottles of medicine A and 40,000 bottles of medicine B, but there are only 45,000 bottles into which either of the medicines can be filled. Further it takes three hours to prepare enough material to fill 1000 bottles of medicine A and one hour to prepare enough material to fill 1000 bottles of medicine B, and there are 66 hours available for this operation. The profit is Rs.7 per bottle for medicine A and Rs.7 per bottle for medicine B. Formulate this problem as a L.P.P How the manufacturer schedule his production in order to maximize profit. 4. A firm can produce three types of cloth, say : A, B, and C. Three kinds of wool are required for it, say :red, green and blue wool. One unit length of type A cloth needs 2 meters of red wool and 3 meters of blue wool; one unit length of type B cloth needs 3 meters of red wool, 2 meters of green wool and 2 meters of blue wool; and one unit of type C cloth needs 5 meters of green wool and 4 meters of blue wool. The firm has only a stock of 8 meters or red wool, 10 meters of green wool and 15 meters of blue wool. It is assumed that the income obtained from one unit length of type A cloth is Rs. 3.00, of type B cloth is Rs.5.00 and of type C cloth is Rs.4.00.Determine , how the firm should use the available material so as to maximize the income from the finished cloth. 5. A farmer has 100 acre farm. He can sell all tomatoes, lettuce, or radishes he can raise. The price he can obtain is Re. 1.00 per kg for tomatoes, Rs. 0.75 a head for lettuce and Rs. 2.00 per kg for radishes. The average yield per-acre is 2,000 kg of tomatoes, 3000 heads of lettuce, and 1000 kgs of radishes. Fertilizer is available at Rs. 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce, and 50 kgs for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes, and 6 man-days for lettuce . A total of 400 man-days of labour are available at Rs. 20.00 per man-day. Formulate this problem as a linear programming model to maximize the farmers total profit. 6. A manufacturer produces three models ( I,II and III) of a certain product. He uses two types of raw material (A &B) of which 4000 and 6000 units respectively are available. The raw material requirements per unit of the three models are given below:

Raw material A B

Requirement per unit of given model I II 2 3 4 2

III 5 7

The labour time for each unit of model I is twice that of model II and three times that of model III. The entire labour force of the factory can produce the equivalent of 2500 units of model I. A market survey indicates that the minimum demand of the three models are 500,500 and 375 units respectively. However, the ratios of the number of units produced must be equal to 3:2:5. Assume that the profit per unit of models I, II and III are rupees 60, 40 and 100 respectively. Formulate the problem as a linear programming model in order to determine the number of units of each product which will maximize profit. 7. Diet problem. One of the interesting problems in linear programming is that of balanced diet. Dieticians tell us that a balanced diet must contain quantities of nutrients such as calories, minerals, vitamins, etc. Suppose that we are asked to find out the food that should be recommended from a large number of alternative sources of these nutrients so that the total cost of food satisfying minimum requirements of balanced diet is the lowest. The medical experts and dieticians tell is that it is necessary for an adult to consume at least 75gm of proteins, 85 g of fats, and 300 gm of carbohydrates daily. The following table gives the food items (which are readily available in the market), analysis, and their respective costs. Food type 1 2 3 4 5 6 Minimum daily requirements Food value (gms.)per 100g Proteins 8.0 18.0 16.0 4.0 5.0 2.5 75 Fats 1.5 15.0 4.0 20.0 8.0 --85 Carbohydrates 35.0 ---7.0 2.5 40.0 25.0 300 Cost per kg. (Rs) 1.00 3.00 4.00 2.00 1.50 3.00

8. An agriculturist has a farm with 126 acres. He produces Radish, Muttar and potato. Whatever he raises is fully sold in the market. He gets Rs.5 for Radish per kg., Rs .4 for Muttar per kg. and Rs. 5 for potato per kg. The average yield is 1,500 kg,of Radish per acre, 1800 kg.of Muttar per acre and 1200 kg of potatoes per acre. To produce each 100kg of Radish and Muttar and to produce each 80 kg of potato, a sum of Rs.12.50 has to be used for manure. Labour required for each acre to raise the crop is 6 man-days for Radish and Potato each and 5 man-days for Muttar. A total of 500 man-days of labour at a rate of Rs.40 per man-day are available. Formulate this as a linear programming model to maximize the agriculturists total profit.

9. A company has three operational departments (weaving, processing and packing )with capacity to produce three different types of cloths namely suitings, shirtings, and woolens yielding the profit of Rs2, Rs. 4 and Rs 3 per meter respectively. One meter suiting requires 3 minutes in weaving , 2 minutes in processing and 1 minute in packing 1 meter of shirting requires 4 minutes in weaving, I minute in processing and 3 minutes in packing while one meter woolen requires 3 minutes in each department. In a week, total run time of each department is 60,40 and 80 hrs of weaving, processing and packing departments respectively. Formulate the linear programming problem to find the product mix to maximize the profit. 10. A firm buys castings of P and Q type of parts and sells them as finished product after machining, boring and polishing. The purchasing cost for castings are Rs. 3 and Rs. 4 each for parts P and Q and selling costs are Rs. 8 and Rs. 10 respectively. The per hour capacity of machines used for machining , boring and polishing for two products is given below: Capacity per hour Machining Boring polishing Parts P 30 30 45 Q 50 45 30

The running costs for machining, boring and polishing are Rs. 30, Rs. 22.5 and Rs.22.5 per hour respectively. Formulate the linear programming problem to find out the product mix to maximize the profit. 11. The owner of Fancy Goods shop is interested to determine how many advertisements to release in the selected three magazines, A, B,and C. His main purpose is to advertise id such a way that total exposure to principal buyers of his goods is maximized. Percentages of readers for each magazine are known. Exposure in any particular magazine is the number of advertisements released multiplied by the number of principal buyers . The following data are available: Particulars B C Readers 0.6 lakh 0.4 lakh Principal 15% 8% buyers 6,000 5,000 Cost per Adv. The budgeted amount is at the most Rs.1.0 lakh for the advertisements. The owner has already decided that magazine A should have no more than 15 advertisements and that B and C each gets at least 8 advertisements. Formulate a linear programming model for this problem. 12. Evening shift resident doctors in a Govt. hospital work five consecutive days and have two consecutive days off. Their five days of work can start on any day of the week and the schedule rotates indefinitely. The hospital requires the following minimum number of doctors working. Magazines A 1.0 lakh 20% 8,000

Sun mon Tue wed thurs Fri sat 35 55 60 50 60 50 45 No more than 40 doctors can start their five working days on the same day. Formulate the general linear programming model to minimize the number of doctors employed by the hospital. 13. An advertising company wishes to plan its advertising strategy in three different mediatelevision, Radio, and magazine . the purpose of advertising is to reach as large a number of potential customers as possible. Following data has been obtained from market survey. Tv Cost of advertisement 40,000 per unit (Rs) No of customers 3,00,000 reached per unit No of female 2,50,000 customers reached. The following are the requirements : Radio 20,000 5,00,000 4,00,000 Magazine 10,000 1,00,000 50,000

I. The company wants to spend not more than Rs. 5 lakh on advertisements. II. At least 1 million exposure must take place among female customers. III. The advertisement on magazines must be limited to Rs 1. Lakh. IV. At least 5 advertisements must appear in magazine. V. At least 5 and not more than eight advertisements must appear in television and radio. Formulate this as an LPP by appropriate objective function and constraints. 14. The XYZ nursing home , has the following requirement of nurse the nurses report to the nursing home at the beginning of each period and work for eight consecutive hours. The nursing home wants to determine the minimum number of nurses to be employed so that there will be sufficient number of nurses available for each period. Formulate this as an LP model. Period 1 2 3 4 5 6 Clock time 6-10am 10-2 pm 2-6 pm 6-10 pm 10-2 am 2-6 am Minimum number of nurse required 7 15 10 22 6 5