Problem 1:

2
3 5
4 3

1
1 2 1 6
6 7

2
2 4

Find the shortest path from nodes 1 to 6.

Problem 2: The warehouses of a company are located in three cities A, B and C. There are four
customers 1, 2, 3 and 4. The capacities of warehouses, demands of the customers and the
distances between the warehouses and customers are given in the Table given below. Determine
a suitable plan for assigning the shipments to the various customer-warehouse combinations that
would minimize the total shipping cost.

Customer
Warehouse Capacity
1 2 3 4
A 270 230 310 690 100
B 100 450 400 320 80
C 300 540 350 570 80
Demand 60 120 50 40

Problem 3: A travelling salesman has to cover a set of 5 cities (his own included) and return
home. The distance between the cities is shown in the map below. Determine the most
economical route.

1
18
17 15 2
14
23
5 16 11
12
15

4 3