0% found this document useful (0 votes)
1 views

Transportation and Assignment problem

The document presents various transportation and assignment problems, detailing multiple scenarios involving sources, destinations, capacities, and costs. It outlines methods to obtain initial basic feasible solutions (IBFS) using techniques such as North West Corner Rule (NWCR), Lowest Cost Entry Method (LCEM), and Vogel’s Approximation Method (VAM). Additionally, it includes problems related to optimal distribution and assignment of resources to minimize costs and maximize efficiency.

Uploaded by

peppasoodan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views

Transportation and Assignment problem

The document presents various transportation and assignment problems, detailing multiple scenarios involving sources, destinations, capacities, and costs. It outlines methods to obtain initial basic feasible solutions (IBFS) using techniques such as North West Corner Rule (NWCR), Lowest Cost Entry Method (LCEM), and Vogel’s Approximation Method (VAM). Additionally, it includes problems related to optimal distribution and assignment of resources to minimize costs and maximize efficiency.

Uploaded by

peppasoodan
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Transportation Problem

Obtain an IBFS to the following TP by (i) NWCR (ii)Lowest cost entry method (iii) VOGEL’S
approximation method .
a. Source\Destination D1 D2 D3 D4 Availability
S1 11 13 17 14 250
S2 16 18 14 10 300
S3 21 24 13 10 400
Requirement 200 225 275 250

b. Source\Destination D1 D2 D3 D4 Availability
S1 1 2 1 4 30
S2 3 3 2 1 50
S3 4 2 5 9 20
Requirement 20 40 30 10 100
c. National Oil Company has three refineries and 4 depots. Transportation costs per barrel and
requirements are given below. Determine IBFS using NWCR, LCEM, VAM.
Source\Destination D1 D2 D3 D4 Capacity
S1 5 7 13 10 700
S2 8 6 14 13 400
S3 12 10 9 11 800
Requirement 300 600 700 400

d. A company has three plants locations A, B, C which supply to warehouses D, E, F, G and H.


Monthly plant capacities are 800,500and 900 units respectively. Monthly warehouses
requirements are 400,400,500,400and 800 units respectively. Unit transportation cost (in Rs.)
are given below:
plants\warehouses D E F G H
A 5 8 6 6 3
B 4 7 7 6 6
C 8 4 6 6 4
Find the Initial distribution for the company in order to minimize the total TP cost by North west
corner rule and Vogel’s approximation method.

e. Source\Destination D1 D2 D3 D4 Availability
S1 6 5 8 8 30
S2 5 11 9 7 40
S3 8 9 7 13 50
Requirement 35 28 32 25

f. Source\Destination D1 D2 D3 D4 Availability
S1 21 16 25 13 11
S2 17 18 14 23 13
S3 32 27 18 41 19
Requirement 6 10 12 15
g. Source\Destination D1 D2 D3 D4 Availability
S1 19 30 50 10 7
S2 70 30 40 60 9
S3 40 8 70 20 18
Requirement 5 8 7 11
h. Source\Destination A B C Availability
I 50 30 220 1
II 90 45 175 3
III 250 200 50 4
Requirement 4 2 2
i. Source\Destination A B C Availability
I 2 2 3 10
II 4 1 2 15
III 1 3 1 40
Requirement 20 15 30
j. Source\Destination D1 D2 D3 D4 Availability
S1 4 6 8 13 15
S2 13 11 10 8 30
S3 14 4 10 13 45
S4 9 11 13 3 20
Requirement 35 45 10 20

2. A manufacturer has distribution centres at Bangalore, Gulbarga and Mangalore. These centres
have availability of 40, 20 and 40 units of his product respectively. His retail outlets at A, B,
C, D and E requires 25, 10, 20, 30 and 15 units respectively. The transportation cost per unit
between each centre and outlet is given below.
Distribution centres\Retail Outlets A B C D E
Bangalore 55 30 40 50 40
Gulbarga 35 30 100 45 60
Mangalore 40 60 95 35 30
Determine the optimal distribution to minimize the cost of transportation.
3. A company has decided to manufacture some or all of five new products at three of its plants.
The production capacity of each of these three plants is as follows:
Plant No Production Capacity (in units)

1 40

2 60

3 90
Sales potential of the five products is as follows:
Product No 1 2 3 4 5

Market Potential (in Units) 30 40 70 40 60


The variable cost per unit for the respective plant and product combination is given s follows:
Product No. 1 2 3 4 5

Plant 1 20 19 14 21 16

Plant 2 15 20 13 9 16

Plant 3 18 15 18 20 0
Determine the optimum product to plant combination to minimize cost.
Assignment Problem
1. Solve the following assignment problem
persons
I II III IV V
A 5 3 4 7 1
jobs B 2 3 7 6 5
C 4 1 5 2 4
D 6 8 1 2 3
E 4 2 5 7 1
2. Job
J1 J2 J3 J4
M1 7 5 8 4
Men M2 5 6 7 4
M3 8 7 9 8
3. A hospital wants to purchase three different types of medical equipments and five
manufacturers have come forward to supply one or all the three machines. However,
the hospital’s policy is not to accept more than one machine from any one of the
manufactures. The data relating to the price (in lakhs of rupees) quoted by the
different manufactures are given below. Determine how best the hospital can
purchase three machines.
Machines I II III
A 30 31 27
Manufacturers B 28 29 26
C 29 30 28
D 28 31 27
E 31 29 26
4. The ABC Construction Company has five crews. The skills of the crews vary because
of the composition of the crews. The company has five different projects currently.
The times (in days) taken by the different crews to complete different projects is given
in the table below. Find the best assignment of the crews to different projects such
that the total time to complete all the projects is minimized.
5. In a textile sales emporium, four salesmen A, B C and D are available to four
customers W, X, Y and Z. Each salesman can handle any counter. The service (in
hours) of each counter when manned by each salesman is given below:
Salesmen
Counters A B C D
W 41 72 39 52
X 22 29 49 65
Y 27 39 60 51
Z 45 50 48 52

How should the salesmen be allocated to appropriate counters so as to minimize the


service time? Each salesman must handle only one counter.
6. An Airline that operates 7 days a week has the time table shown below. Crews must
have a minimum layover of 5 hours between Flights. Obtain the paring of flights that
minimizes layover time always from home assuming the crew flying from Delhi and
Jaipur can be based either at Delhi or Jaipur for any given pairing the crew will be
based at the city that results in the smaller layover.
Flight No Delhi Depart Jaipur Arrival Flight No Jaipur Depart Delhi
Arrival
1 7.00 A.M 8.00 A.M 101 8.00 A.M 9.00 A.M
2 8.00 A.M 9.00 A.M 102 8.30 A.M 9.30 A.M
3 1.30 P.M 2.30 P.M 103 12 Noon 6.30 P.M
4 6.30 P.M 7.30 P.M 104 8.00 P.M 9.0 .M

7. Consider the problem of assigning four sales people to four different sales regions.
Find the optimal allocation of sales person to different sales region. The cell entries
represent annual sales figures in lakhs of rupees.
Sales Region
1 2 3 4
Salesman 1 10 22 12 14
2 16 18 22 10
3 24 20 12 18
4 16 14 24 20
Provide the business case of the assignment problem above giving the total sales output

You might also like