QA II Assignment
QA II Assignment
Assignment I Date of Submission: 22nd March, 2013 Submission is to be done in separate notebook.
1) A firm is engaged in producing two products, A and B. Each unit of A requires 2 kg of raw material and 4 labour hours, each unit of B requires 3 kg of raw material and 3 hours of labour. Every week, the firm has an availability of 60 kg of raw material and 96 labour hours. One unit of A sold yields Rs. 40 and one unit of B sold yields profit of Rs.35. Formulate the problem as LP model and solve it to determine number units of each product to maximize the profit. 2) The agricultural Research Institutes suggested to a farmer to spread out at least 4800 kg of a special phosphate fertiliser and not less than 7200 kg of a special nitrogen fertiliser to raise productivity of crops in his fields. There are two sources for obtaining these mixtures A and B. Both of these are available in bags weighing 100 kg each and they cost Rs. 40 and Rs. 24 respectively. Mixture A contains phosphate and nitrogen equivalent of 20 kg and 80 kg respectively, while B contains these ingredients equivalent of 50 kg each. Solve the LPP by graphical method. 3) Solve the LPP. Maximize Z = 8X1 + 16X2 Subject to: X1 + X2 200 X2 125 3X1 + 6X2 900 X1, X2 0 4) Solve the problem. Minimise Z = 6X1 + 14X2 Subject to: 5X1 + 4X2 60 3X1 + 7X2 84 X1 + 2X2 18 X1, X2 0 5) A company manufactures 3 types of parts which use precious metals platinum and gold. Due to shortage of these precious metals, the government regulates the amount that may be used per day. The relevant data with respect to supply, rewuirements and profits are summarised in the table as follows: Product Platinum Gold required Profit/unit (Rs) required (gms) (gms) A 2 3 500 B 4 2 600 C 6 4 1200
Daily allotment of platinum and gold are 160 gms and 120 gms respectively. How should the company divide the supply of scarce precious metals? Formulate it as linear programming problem. 6) Write Dual: Maximize Z = 40X1 + 35X2 Subject to: 2X1 + 3X2 60 4X1 + 3X2 96 X1, X2 0 7) Write Dual : Also write duals dual. Maximize Z = 8X1 + 10X2 + 5X3 Subject to: X1 X3 4 2X1 + 4X2 12 X1 + X2 + X 3 2 3X1 + 2X2 X3 = 8 X1, X2 , X3 0 8) Obtain Dual: Maximize Z = 3X1 + 5X2 + 7X3 Subject to: X1 + X2 + 3X3 10 4X1 - X2 + 2X3 15 X1, X2 0, unrestricted of sign