Question 1: A person requires 10, 12 and 12 units of chemicals A, B and C respectively for medicine.

A liquid syrup contains 5, 2 and 1 units of A, B and C respectively per Jar. A tablet contains 1, 2 and 4 units of A, B and C per cartoon. If the liquid syrup sells for Rs. 3 per Jar and tablet sells for Rs. 2 per cartoon, how many of each should be purchased to minimize the cost and meet the requirements.

Solution:

Requirement Tablet Liquid Syrup

A 10 units 1 5

B 12 units 2 2

C 12 units 4 1

Sale Price Rs2/cartoon Rs3/jar

Decision Variable: X1= No. of jars of liquid Syrup X2= No. of cartons of Tablet

Objective Function: Minimize Cost (Z) = 3X1 + 2X2

Constraints: 5X1 + 2X2 >= 10 2X1 + 2X2 >= 12 1X1 + 4X2 >=12 Non Negativity Constraints: X1>= 0, X2>= 0

Question 2: A manufacturer of a line of patent medicine is preparing a production plan on medicine A and B. There are sufficient ingredients available to make 20,000 bottles of A and 40,000 bottles of B but there are only 45,000 bottles into which either of medicines can be put. Furthermore it takes 3 hours to prepare enough material to fill 1,000 bottle of A, it takes one hour to prepare enough material to fill 1000 bottles of B and there are 66 hours available for this operation. The profit is Rs. 8 per bottle for A and Rs. 7 per bottle of B. a) Formulate the problem as Linear Programming Problem. b) How much manufacturer should product in order to maximize this profit?

Solution: Decision Variable X1 = No. of bottles of medicine A X2= No. of bottles of medicine B Objective Function Z (max) = 8X1 + 7X2 Constraints C1 : 3X1 +X2 <= 66 C2 : X1 + X2 <= 45000 C3 : X1<= 20000 C4 : X2 <= 40000 C5 : X1, X2 >= 0 (Non Negative Constraints)

Question 3: A company manufacturers two products X and Y which require the following resources. The resources are the capacities machine M1 M2 M3. The available capacities are 50, 25 and 15 hours respectively in the planning period. Product X requires 1 hour of machine M2 and 1 hour of machine M3. Product Y requires 2 hours of machine M1, 2 hours of machine M2 and 1 hour of machine M3. The profit contribution of product X and Y are 5 Rs and 4 Rs respectively.

Machines

Products X Y 2 2 1 4

Availability (in hours)

M1 M2 M3 Profit (Rs/Unit)

0 1 1 5

50 25 15

Solution : Decision Variables: Product X and Y are completely variables objective functions. Objective Function: Z (Max): 5X+ 4Y Constraints: Linear Structural Constraints: For Machine M1 0x+ 2Y <= 50 For Machine M2 1X+2Y <= 25 and For Machine M3 1X+ 1Y <= 15

Non Negativity Constraints: Both X and Y are 0.

Question 4: Three nutrient components namely, thiamine, phosphorous, and iron are found in a diet of two food items A & B. The amount of each nutrient in each of the foods (in milligrams per ounce, ie mg/oz is given below.

A Thiamine Phosphorous Iron 0.15mg/oz 0.75mg/oz 1.30mg/oz

B 0.10mg/oz 1.70mg/oz 1.10mg/oz

The cost of food A and B is Rs. 2 per oz and Rs. 1.70 per oz. respectively. The minimum daily requirements of these nutrients are at least 1.00 mg of thiamine, 7.50 mg of phosphorous and 10 mg of iron. Formulate this as a linear programming problem. Solution: Decision Variables: X1 and X2 as the no. of units (ounces) purchased of food items A & B respectively. Objective Equation: Z(Min.) = 2 X1+1.72 X2 Constraints: 0.15 X1 + 0.10 X2 >= 1.0 0.75 X1 + 1.70 X2 >=7.5 1.30 X1 + 1.10X2 >= 10.0 X1>=0, X2>=0

Question 5: A factory manufactures two products A and B on three machines X, Y and Z. Product A requires 10 machine X and 5 hours of machine Y and 1 hour of machine Z. The requirement of product B is 6 hours 10 hours and 2 hours of machine X, Y and Z respectively. The profit contribution of products A and B are 23 per unit and Rs 32 per unit respectively. In the coming planning period the available capacity of machines X, Y and Z are 2500 hours, 2000 hours and 500 hours respectively. Find the optimal product mix for maximizing the profit.

Machines

Product A B 6 10 2 32

Capacity (hours)

X Y Z Profit/Unit (Rs.)

10 5 1 23

2500 2000 500

Solution: Decision Variable: Let the company manufactures a units of A and b units of B Objective Equation: Z(Max.)= 23a+ 32b Structural Constraints: 10a + 6b <= 2500 5a + 10b <= 2000 1a + 2b <= 500 Non negativity constraints: a>=0, b>=0

Question 6: Reddy Mikks produces both interior and exterior paints from two raw materials, M1 and M2. The following table provides the basic data of the problem. Tons of raw material per ton of Exterior Paint Interior Paint 6 4 1 2 4

Raw Material, M1 Raw Material, M2

Availability(tons) 24 6

Profit per ton ($1000) 5

A market survey indicates that the daily demand for interior paint cannot exceed that of exterior paint by more than 1 ton. Also, the maximum daily demand of interior paint is 2 tons. Reddy Mikks wants to determine the optimum (best) product mix of interior and exterior paints that maximizes the total daily profit. Decision Variables: X1 = Tons produced daily of exterior paint X2 = Tons produced daily of exterior paint

Objective Equation: Z (Max) = 5 X1 + 4 X2 Constraints: C1:6 X1+ 4 X2 24 C : X1 + 2 X2 6 C3 :X2 - X1 1 C4 :X2 2 Non Negativity Constraints: X1 , X2 0

Question 7 : A toy company manufacturers two types of dolls. A basic version doll A and a deluxe version doll B. Each doll of type B takes twice as long to produce as one of type A and the company would have time to make a maximum of 2000 per day. The supply of plastic is sufficient to produce 1500 dolls per day (both A & B combine). The deluxe version requires a fancy dress of which there are only 600 per day available. If the company makes a profit of Rs. 3 and Rs. 5 per doll, respectively on doll A and doll B. How many of each should be produced per day in order to maximize profit. Solution: Decision Variable X1 = No. of dolls of type A produced per day X2= No. of dolls of type B produced per day

Objective Function Z (max) = 3X1 + 5X2 Constraints C1 : X1 +2X2 <= 2000 (Time Constraints) C2 : X1 + X2 <= 1500 (Plastic Constraints) C3 : X2 <= 600 (Dress Constraints) C4 : X1, X2 >= 0 (Non Negative Constraints)

Question 8:A firm manufactures from different machine parts M1, M2, M3, M4 made of copper and zinc. The amounts of copper and zinc required for each machine parts, their exact availability and profit earned from one unit of each machine parts are as follows: Copper Zinc Profit Solution: Decision Variable X1 = Quantities to be manufactured by machine M1 X2 = Quantities to be manufactured by machine M2 X3 = Quantities to be manufactured by machine M3 X4 = Quantities to be manufactured by machine M4 Objective Function Z (max) = 12X1 + 8X2 + 14X3 + 10X4 Constraints C1 : 5X1 +4X2 + 2X3 + X4 <= 100 C2 : 4X1 + 3X2 + 8X3 + X4<= 75 C3 : X1, X2, X3, X4 >= 0 (Non Negative Constraints) M1 5 4 12 M2 4 3 8 M3 2 8 14 M4 1 1 10 Availability(kg) 100 75

Question 9: A firm manufactures three products A, B. C. Time to manufacture product A

is twice that for B and thrice that for C and they are to be produced in the ratio 3:4:5. The relevant data is given. If whole raw material is engaged in manufacturing product A, 1600 units of this product can be produced. There is a demand for at least 300, 250, 200 units of products A, B, C and the profit earned per unit is Rs.50, Rs.40, Rs.70 respectively. Raw Material P Q A 6 4 Requirement per unit of produced B C 5 9 7 8 Total Availability 5000 6000

Solution:Decision Variable
X1 = No. of units of products A to be manufactured X2 = No. of units of products B to be manufactured X3 = No. of units of products C to be manufactured X4 = Quantities to be manufactured by machine M4

Objective Function
Z (max) = 50X1 + 40X2 + 70X3

Constraints
C1 : 6X1 +5X2 + 9X3 <= 5000 C2 : 4X1 + 7X2 + 8X3 <= 6000 C3 : X1 + X2 + 1/3 X3 <= 1600 Market Demand requires C4 : X1 >= 300 C5 : X2 >= 250 C6 : X3 >= 200 Since product A, B, C are to be produced in the ratio 3:4:5 X1: X2:X3 = 3:4:5 X1/3 = X2/4 and X2/4 = X3/5

C7 : 4X1- 3X2 = 0 C8 : 5X2 4X3 = 0 C9 : X1, X2, X3, X4 >= 0 (Non Negative Constraints)

Question 6: A farmer has two acre farm. He can sell all the tomatoes, drumstick or radishes he can raise. The price he can obtain is Re 1 per Kg of tomatoes, Re 0.75 for a head of drumstick and Rs 2 per Kg for radishes. The average yield per acre is 2000 Kg of tomatoes, 3000 heads of drumstick, and 1000 Kg of radishes. Fertilizer is available at Re 0.50 per Kg and the amount required per acre is 100 Kg each for tomatoes and drumstick, and 50 kg for radishes. Labor required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for drumstick. A total of 400 man-days of labor are available at Rs 20 per man-days. Formulate this problem as a linear programming model to maximize the farmers profit.

Decision Variables: X1= number of acres allotted for tomato cultivation X2= number of acres allotted for drumstick cultivation X3= number of acres allotted for radish cultivation Objective Of Decision Maker: The farmers total profit = Sale Expenditure Total Sale of farmer will be = Rs [12000 X1 + 0.753000 X2 + 21000 X3] = Rs 2000X1 + 2250X2 + 2000X3 The fertilizer expenditure will be = Rs 0.50 (100X1 + 100X2 + 50X3) = Rs (50X1 + 50X2 + 25X3) Labor expenditure will be = Rs 20 (5X1 + 6X2 + 5X3) = Rs (100X1 + 120X2 + 100X3) The total expenditure = Rs (150X1 + 170X2 + 125X3) The total profit is = Rs [Sale - Expenditure] = Rs [2000X1 + 2250X2 + 2000X3] Rs [150X1 + 170X2 + 125X3] = Rs [1850X1 + 2080X2 + 1875X3]

Objective Equation: Z (Max) = 1850X1 + 2080X2 + 1875X3

Constraints: C1 : X1 + X2 + X3 100 C2 : 5X1 + 6X2 + 5X3 400 Non Negativity Constraints: X1 , X2 , X3 0