UNIT 2

ASSIGNMENT MODEL

HUNGARIAN METHOD
Q.1.) There are four men and each of these perform their task in different ways. Assign a task to
each man to minimize the total time spent.

Men A B C D
Task
a 18 26 17 11
b 13 28 14 26
c 38 19 18 15
d 19 26 24 10

Q.2.) At the end of the cycle of schedule a transporting firm has a surplus of one vehicle in each of
the cities 1,2,3,4, and 5 and to each vehicle A, B, C, D, E, and F. The cost in (Rs) of transportation and
handling between the cities with a surplus and the cities as shown in following table. Find the
assignment of surplus vehicle to each city that will result in a minimum total cost, which city will not
receive a vehicle. Assign appropriate combination.
Surplus A B C D E F
vehicle
Deficit
Cities
1 134 116 167 230 194 97
2 114 195 260 116 178 130
3 129 117 48 94 66 101
4 71 156 92 143 114 136
5 97 134 125 83 142 118

Q.3.) A machine tool company decided to make four sub-assemblies through four contractors.
Each contractor is to receive only one sub-assembly. The cost of each sub-assembly is
determined by the bid submitted by each contractor and is shown in the table in 100 of rupees.
Assign the different sub-assemblies to contractors so as to minimize the total cost.
Contractor 1 2 3 4
Sub-assemblies
1 15 13 14 17
2 11 12 15 13
3 13 12 10 11
4 15 17 14 16

Q.4.) A race horse owner has four horses named A, B, C, and D and plans to enter them four races. If
he wishes to enter one horse in each race and cannot enter any horse in more than one race. How
should he enter them so as to make his expected total purse winning as great as possible.
Horse Probability of Winning
Race1 Race2 Race3 Race4
A 0.4 0.3 0.2 0.8
B 0.2 0.2 0.15 0.3
C 0.15 0.1 0 0.2
D 0.10 0.0 0 0.2
Purse 5000 7500 25000 40000
Q.5.) Production cost of products P1, P2, P3 per unit manufactured on machines M1, M2, M3, M4 are as
tabulated in table. Sales price per unit for P1=₹70/unit for P2=₹85/unit and for P3=₹60/unit.

Machine M1 M2 M3 M4
Products
P1 40 50 30 25
P2 30 20 30 30
P3 30 35 25 35

Decide product machine combination for maximization of total profit.

Q.6.) Four different jobs can be done on four different machines. The setup and takedown time cost
are assumed to be prohibitedly high for changeovers. The matrix below gives the cost in rupees of
producing job I and machine J.

Machine M1 M2 M3 M4
Job
I1 5 7 11 6
I2 8 5 9 6
I3 4 7 10 7
I4 10 4 8 3

How should the job be assigned to the various machines to that the total cost is minimized.

Q.7.) A company has one surplus truck in each of the cities A, B, C, D, and E and one deficit truck in
each of the cities 1, 2, 3, 4, and 5. The distance between the cities in kilometers is shown in the matrix
below. Find the assignment of trucks from cities in surplus to cities in deficit so that the total distance
covered by vehicle is minimum.

Cities 1 2 3 4 5 6
(deficit)
Cities
(surplus)
A 12 10 15 22 18 8
B 10 18 25 15 16 12
C 11 10 3 8 5 9
D 6 14 10 13 13 12
E 8 12 11 7 13 10

Q.8.) An airline that operates seven days a week has the time table as shown in the table. A crew must
have a minimum layover time of 5 hours between the flights. Obtain pairing of flights that minimizes
layover time. For each pairing also mention the term for which the crew will be based.
Flight No. Delhi Jaipur
Departure Arrrival
101 7:00 am 8:00 am
102 8:00 am 9:00 am
103 1:30 pm 2:30 pm
104 6:00 pm 7:30 pm
 Flight No. Delhi Jaipur
Departure Arrival
201 8:00 am 9:15 am
202 8:00 am 9:45 am
203 12:00 noon 1:15 pm
204 5:30 pm 6:45 pm

Q.9.) Four new machines M1, M2, M3, and M4 are to be installed in a machine shop there are five
vacant places A, B, C, D, and E available because of limited space machine M 2 cannot be placed at C
and M3 cannot be placed at A. The assignment cost of machine I to place J in rupees is shown below.
Vacant A B C D E
Places
Machines
M1 4 6 10 5 6
M2 7 4 - 5 4
M3 - 6 9 6 2
M4 9 3 7 2 3
Find the optimal assignment schedule.

Q.10.) A company has a team of 4 salesman and there are four districts where the company wants to
start its business after taking into account the capabilities of salesman and the nature of districts the
company estimates that the profit per day in rupees for each salesman in each district is as shown.
Districts 1 2 3 4
Salesman
A 16 10 14 11
B 14 11 15 15
C 15 15 13 12
D 13 12 14 15
Find the assignment of the salesman to various districts which will yield maximum profit.

BRANCH AND BOUND METHOD

Q.11.) A salesman wants to visit cities A, B, C, D, and E. He does not want to visit any city twice before
completing his tour of all the cities and wishes to return to the point of starting the journey. Cost of
going from one city to another in rupees is shown in table. Find the least cost route.

A B c D E
A 0 2 5 7 1
B 6 0 3 8 2
C 8 7 0 4 7
D 12 4 6 0 5
E 1 3 2 8 0

TRANSPORTATION MODEL
Q.12.) A regional airlines can buy its fuel from any one of three vendors. The airline needs for the
upcoming month at each of the three airports it serves are:-
1. 1 Lakh kiloliters at airport 1
2. 1 Lakh 80000 kiloliters at airport 2
3. 3 Lakh 50000 kiloliters at airport 3
Each vendor can supply fuel to each airport at a price (rupees/kiloliters) as shown in table:-
To I II III
From
1 92 89 90
2 91 91 95
3 87 90 92
Each vendor however is limited in the total no. of kiloliters it can provide during a month. These
capacities are:-
1.3Lakh 20000 Kiloliters for vendor 1
2. 12 Lakh 70000 Kiloliters for the vendor 2
3. 1 Lakh 90000 Kiloliters for the vendor 3
Determine purchase policy that will supply the airlines requirement at each airport at minimum total
cost.

Q.13.) Find the optimum solution to the transportation problem given below in the table.
W1 W2 W3 W4 Supply
F1 14 25 45 5 6
F2 65 25 35 55 8
F3 35 3 65 15 16
Demand 4 7 6 13

Q.14.) A cement manufacturing industry wishes to transport cement from its three factories P, Q, and
R to five distribution depos A, B, C, D, and E. The quantities produced at the factories per week
requirements of the depos and respective transportation cost in rupees per ton are given in the table.
Distribution A B C D E Supply
Depos
Factories
P 4 1 3 4 4 60
Q 7 3 2 2 3 35
R 3 5 2 4 4 80
Demand 22 45 20 18 30

Q.15.) A military equipment is to be transported from three origins to four destinations. The supply at
the origins, the demand at the destinations and time of shipment is shown in the table below. The unit
to be shipped as obtained by north-west corner. Work out a transportation plan sot that total time
required for shipment is minimum.
Destinations 1 2 3 4 Supply
Origins
1 10 0 20 11 15
2 1 7 9 20 25
3 12 14 16 18 5
Demand 12 8 15 10
Q.16.) A manufacturer has distribution centers located at Agra, Allahabad, and Mumbai. These centers
have 40, 20, and 40 of products available with them. These retail outlet required following number of
units. A-25, B-10, C-20, D-30. The transportation cost per unit in rupees between each center and
outlet is given in table. Find the optimal cost.
Retail outlets A B C D
Distribution
Centers
Agra 50 30 40 50
Allahabad 35 30 100 45
Mumbai 40 60 95 35

Q.17.) Three factories A, B, and C have 8, 4, and 9 units of product which has to be supplied to four
costumers who requires 4, 8, 3, and 6 units respectively the profit per unit is shown in the following
table.
I II III IV
A 5 7 9 1
B 5 3 7 8
C 7 8 9 2
i. Find the optimum allocation and the profit.
ii. Calculate the second possible optimum solution.

ASSIGNMENT-01
Q.1.) A car rental company has 1 car at each of 5 depos A, B, C, D and E. A costumer in each of the 5
towns 1,2,3,4 and 5 requires a car. The distance (km) between the depo and towns where the
costumers are
Depos A B C D E
Towns
1 160 130 175 190 200
2 135 120 130 160 175
3 140 110 155 175 185
4 50 50 80 80 110
5 54 34 70 80 105
How should the car be assigned to costumer to minimize the distance travelled.

Q.2.) An airline that operates between Delhi (A) and Calcutta (B) as the time-table as shown in tables
given below. Crews must have a minimum layover of 5 hours between flights. Obtain the pairing of
flights that minimizes layover time away from home. Note that cruise flying from A to B and back can
be based either at A or at B for any given pairing they will be based at the city that results in the
smaller layover.
Delhi-Calcutta
Flight no. Departure Arrival
1 6:00 am 7:00 am
2 7:30 am 8:30 am
3 10:30 am 11:30 am
4 2:00 pm 3:00 pm
5 6:00 pm 7:00 pm
6 11:30 pm 0:30 am
 Calcutta-Delhi
Flight no. Departure Arrival
101 8:00 am 9:15 am
102 9:00 am 10:15 am
103 11:30 am 0:45 pm
104 3:00 pm 4:15 pm
105 7:30 pm 8:45 pm
106 10:00 pm 11:15 pm

Q.3.) A tourist wants to visit Delhi- Bombay- Calcutta- Chennai- Nagpur spending as little time as
possible and staying at each city once only. Journey times are as given in the table.
A B C D E
A ∞ 1 4 2 ∞
B 1 ∞ 3 1 3
C 5 4 ∞ 4 2
D 2 1 5 ∞ 1
E 3 2 3 1 ∞
Find the least cost route.

Q.4.) A production control superintendent finds the following information at his table in department A,
B, and C the no. of surplus pellets is 18, 27, 21 respectively. In department G, H, I, J the no. of pellets
required is 14, 12, 23 respectively. This time in moving one pellet from one department to another is
given in the following table. What is optimal distribution plan to minimize the moving time.
G H I J
A 13 25 12 21
B 18 23 14 9
C 23 15 12 16

Q.5.) A baking firm can produce a specialised bread in either of the two plants as follows:-
Production Production Production cost
Plants (loaf) (per loaf)
Plant A 2500 2.3
Plant B 2100 2.5
Four restaurants are willing to purchase these breads. Their demand and prices, they are willing to pay
are as follows :-
Restaurants Demand Rice offered
(loaf) (per loaf)
1 1800 3.9
2 2300 3.7
3 550 4.0
4 1750 3.6
The cost in rupees of shipping the loaf from a plant to restaurant is as given below :-
Restaurant 1 2 3 4
Plant
A 0.6 0.8 1.1 0.9
B 1.2 0.6 0.8 0.5
Determine optimum production and distribution schedule for baking firm.