INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR End-Autumn Semester 2018-19 Date of Examination: 19/11/2018 Session: A/N Duration 3 hrs Full marks 100 Subject No: MI31007 Subject: Quantitative Decision making Department/Center/School: Mining Engineering Specific charts, graph paper, log book etc., required : Not required Special Instructions (if any) : Answer any five questions. Figures in margin indicate marks. Answer all the sections of question number 6 at the same place. 1. A company is faced with the problem of assigning six different jobs JI, 12, 33, 14, J5, and J6 to five different machines M1, M2, M3, M4, and MS respectively. Each job can be assigned to only one machine. The costs of these assignments estimated in hundreds of rupees are given in the table below MI M2__—iM3 M4 MS. i 25 [5 1 6 2 2 2 5 15 7 3 B 3 | 65 2 8 3 4 35 | 7 2 9 45 5 4 7 3 9 6 16 6 9 3 10 6 (@ Formulate the problem as an assignment model for the assignment of jobs to machines so that the total cost of assignment is minimum. @) ii) Find an optimal solution using the assignment algorithm. What is total cost of assignment? (12) (iii) Is the optimal solution unique? Justify your answer. qa (iv) If the optimal solution is not an unique optimal solution, then find an altemative optimal solution. 6) 2. Consider the following linear programming problem: Maximize Z = 2X1 + 5X2 Subject to : Xi +4X2 $24 (Resource A) 3X1 + X. $21 (Resource B) Xi + Xz <9 (Resource C) and X1 20 , X220 (i) Solve the problem by the simplex method. (14) (i) Evaluate the economic worth of resources. 2 (ii) Perform s» sitivity analysis to de: rine the range of fees'bility for the resource @3. A company has three coal mines M1, M2, and M3 which produce 1400, 2700, and 1400 tons respectively. The company supplies coal to four power plants. The requirements of the four power plants are 1500, 1900, 1100 and 1000 tons of coal respectively. The cost of transporting (in rupees) per unit ton of coal from each mine to each power plant is presented in the table below. Power Plant Pi P2 P3 P4 MI 90 70 100 80 Mines M2 80 110 90 110 M3 130 100 120 100 (® Find an initial basic feasible solution using the North-West comer rule. (5) (ii) Determine an optimal transportation schedule using the initial basic feasible (15) solution of the North-West comer rule. What is the total cost of transportation? 4, Consider the following linear programming problem: Maximize Z = 4X1 + 3Xa ‘Subject to : Xi +X <30 3X1 +2%<50 and X1 20, X20 ol Write the dual of the above primal problem. GB) Solve the dual problem by the simplex method. (a5) de ‘Show that the complementary optimal solutions property is satisfied for the above problem. @ 5. Write short notes on the following with suitable examples: (4x5) (Balanced and unbalanced transportation problems Gi) Duality theory Gii) Minimum ratio test in linear programming (iv) Degeneracy in linear programming.iy) What for 95% may be assumed oe ‘ relevant parameters. (@) The following table gives the activities in 2 i Direct crash : Norma [Crash | Dect normal Tesivity | mmediate [Normal Vivre | ost cost x - 5 fi 0 100 3 7 3 10 260 ro 5 2 a8 10 D 6 4 10 260 E c 3 3 tf 10 110 | F A 8 6 125 185 G DBE 5 3 110 250 Indirect cost values for the activities are mentioned as follows: ps Js [4a [3s fo je |e | 8 1 6 Con [700 [ooo so |sso [27s |200 jas joo 3s |S (i) Draw arrow diagram for the project. ii) Determine the cost. ration the project afic’ first crashing to mininize the total project 6) ¢