Scribd
Upload
183 views

Operations Research Assignment - 5 A.P

The document discusses 12 assignment problems involving allocating jobs, tasks, trucks or cars to machines, subordinates, depots or people in a way that minimizes costs, distances or maximizes returns. The problems are solved using the Hungarian algorithm and the optimal assignments and objective values are provided in tables at the end of each problem statement.

Uploaded by

Daksh Oswal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
183 views

Operations Research Assignment - 5 A.P

The document discusses 12 assignment problems involving allocating jobs, tasks, trucks or cars to machines, subordinates, depots or people in a way that minimizes costs, distances or maximizes returns. The problems are solved using the Hungarian algorithm and the optimal assignments and objective values are provided in tables at the end of each problem statement.

Uploaded by

Daksh Oswal
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Topic 3 Assignment Problem

1. A department head has four subordinates and four tasks have to be performed. The subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. His estimate of the times each man would take to perform each task, is given in the effectiveness matrix below. How should the task be allocated, one to a man, so as to minimize the total man hours? OR Solve the following Assignment problem: Machines A B C D Jobs I 8 13 38 19 II 26 28 19 26 III 17 04 18 24 IV 11 26 15 10

[3 table; A I, B III, C II AND D IV; OPTIMAL SOL. 41 MAN HOUR]

2. There are five jobs to be assigned, one each to five persons and the associated cost matrix is as follows. Solve the following assignment problem.

Jobs A B C D E

Persons I 11 9 13 21 14 II 17 7 16 24 10 III 8 12 15 17 12 IV 16 6 12 28 11 V 20 15 16 26 15

[4 TABLES; A I, B IV, C V, D III, E II; RS. 60]

3. A company has 5 jobs to be done, the following matrix shows the return in Rs. Of assigning i th (i = 1, 2, .., 5) machine to j th (j = 1, 2, ..5) job. Assign the five jobs to the five machines so as to maximize the total return. OR Solve the following Assignment problem so as to maximize the total return

Machines A B C D E

Jobs I 5 2 3 6 7 II 11 4 12 14 9 III 10 6 5 4 8 IV 12 3 14 11 12 V 4 5 6 7 15

[3 tables; A - , B 5, C 4, D 2, E 1; RS. 50]

4. A national truck rental service has a surplus of one truck in each of the cities 1, 2, 3, 4, 5, and 6 and a deficit of one truck in each of the cities 7, 8, 9, 10, 11, and 12. The distances (in km) between the cities with a surplus and a deficit are displayed below : how should the trucks be dispersed so as to minimize the total distance travelled?

From / To 1 2 3 4 5 6

7 31 12 17 35 19 72

8 62 19 29 40 30 30

9 29 39 50 38 29 30

10 42 55 41 42 16 50

11 15 71 22 27 20 41

12 41 40 22 33 23 20

[2 TABLES; 1 11, 2 8, 3 - 7, 4 9, 5 10, 6 12; 125 KM]

5. A car hire company has one car at each of five depots a, b, c, d, and e. a customer requires a car in each town, namely A, B, C, D, and E. Distances (in km) between the depots (origins) and towns (destinations) are given in the following matrix. How should the cars be assigned to customers so as to minimize the distance travelled?

Towns A B C D

Depots a 160 135 140 50 B 130 120 110 50 c 175 130 155 80 d 190 160 170 80 e 200 175 185 110

55

35

70

80

105

[2 TABLES; A e, B c, C b, D a, E d; 570 km]

6. Solve the following assignment problem for Maximization. Source/ destinations 1 2 3 4 a 42 30 30 24 b 35 25 25 20 c 28 20 20 16 d 21 15 15 12

[3 tables; A I, B II, C III, D IV OR A I, B II, C III, D IV]

7. There are five jobs to be assigned, one each to five persons and the associated cost matrix is as follows. Solve the following assignment problem.

Jobs A B C D E

Machines I 9 6 5 4 2 II 7 6 3 2 8 III 6 7 4 5 3 IV 2 6 4 9 9

[2 tables; A IV, B V, C- III, D II, E - I;10] 8. Solve the following assignment problem.

Source/ destinations

1 2 3 4

45 57 49 41

40 42 52 45

51 63 48 60

67 55 64 55

[ A 4, B 1, C 3, D 2] 9. Solve the following assignment problem. Source/ destinations I II III IV 1 2 4 7 3 2 3 5 8 5 3 4 6 9 8 4 5 7 8 4

[I- 1, II 2, III 3, IV - 4] 10. Solve the following assignment problem. Source/ destinations 1 2 3 4 a 3 3 2 2 b 2 2 3 3 c 1 4 1 4 d 4 1 4 1

[minimum cost = 20]


11. Solve the following Assignment problem.

Jobs A B C D E

Persons 1 10 9 7 3 9 2 3 7 5 5 10 3 3 8 6 8 9 4 2 2 2 2 6 5 8 7 4 4 10

[A 2, B 4, C 5, D 1, E - 3] 12. Solve the following Assignment problem for maximization.

Jobs

Persons 1 2 3 4 5

A B C D E

40 48 49 30 37

46 32 35 46 41

48 36 41 49 48

36 29 38 44 43

48 44 45 44 47

[A 2, B 5, C 1, D 3, E 4; A 2, B 5, C 1, D 3, E 3; A 2, B 1, C 5, D 3, E 4 AND A 2, B 1, C 5, D 4, E - 3] 13. Solve the following Assignment problem for maximization.

Source/ destinations I II III IV

1 42 30 30 24

2 35 25 25 20

3 28 20 20 16

4 21 15 15 12

[I 1, II 2, III 3, IV 4; I 1, II 3, III 2, IV 4]

Saddle Point Method


Solve the following game . 1.

B A
2.

B A [ ]

Topic 4 Game Theory (GT)

3.

Dominance Rule
Solve the following game . 1.

B A
2.

A [ ]

Graphical Method
Solve the following game . 1.

B A [
2.

B A [ ]

3.

B A [ 4. B A [ 5. B A [ ] ] ]

You might also like