Course: MT4031- OR Assignment No.03 Deadline: October 31
CLO#04 Use appropriate techniques to compute the optimal solutions of Some spe- cial type of the LPP like (Assignment problems, transport problems etc.)
Question no. 01 The Childfair Company has three plants producing child push chairs that are to be shipped to four distribution centers. Plants1,2, and3 produce12,17, and11 shipments per month, respectively. Each distribution center needs to receive10 shipments per month. The distance from each plant to the respective distributing centers is given below:
Distribution Center 1 2 3 4 Plant1 800 miles 1, 300 miles 400 miles 700 miles Plant2 1, 100 miles 1, 400 miles 600 miles 1, 000 miles Plant3 600 miles 1, 200 miles 800 miles 900 miles
The freight cost for each shipment is $100 plus 50 cents per mile. How much should be shipped from each plant to each of the distribution centers to minimize the total shipping cost?
(a) Formulate this problem as a transportation problem by constructing the appropriate
parameter table.
(b) Draw the network representation of this problem.
(c) Obtain an optimal solution.
Question no. 02 Consider the transportation problem having the following param- eter table where Pi ’s are Plants and Di ’s are distinations:
Use each of the following criteria to obtain an initial basic feasible (BF) or starting solution. Compare the values of the objective function for these solutions.
(a) Northwest corner rule.
(b) Least Cost method.
1 (c) Vogel’s approximation method.
and then find the optimal solution by considering the Northwest corner method as starting solution.
Question no. 03 The coach of an age group swim team needs to assign swimmers to a 200-yard medley relay team to send to the Junior Olympics. Since most of his best swimmers are very fast in more than one stroke, it is not clear which swimmer should be assigned to each of the four strokes. The five fastest swimmers and the best times (in seconds) they have achieved in each of the strokes (for 50 yards) are as follows:
Stroke Carl Chris David Tony Ken
Backstroke 37.7 32.9 33.8 37.0 35.4 Breaststroke 43.4 33.1 42.2 34.7 41.8 Butterfly 33.3 28.5 38.9 30.4 33.6 Freestyle 29.2 26.4 29.6 28.5 31.1 The coach wishes to determine how to assign four swimmers to the four different strokes to minimize the sum of the corresponding best times.
(a) Formulate this problem as an assignment problem
(b) Obtain an optimal solution by using the Hungarian Method.
Question no. 04 Five mechanics are available to do work on six machines, and the respective efficiency in percentage of each mechanic—machine combination are given in the table. Determine the optimal assignment of work to mechanics with maximum efficiency.
Machines ↓ Mechanics → 1 2 3 4 5 6 A 59 51 61 53 72 53 B 73 0 83 51 77 84 C 85 62 57 0 77 81 D 82 72 89 57 76 80 E 0 74 81 79 88 75
