ASSIGNMENT – 25 and 26
REVIEW
Problem – 1
Solve the following problem
10
13
4
14
3
20
9
15
7
12
5
12
7
1
5
7
8
9
0
19
Problem – 2
Consider the transportation problem where two factories are supplying three retail
stores with a certain commodity. The number of units available at factories 1 and 2
are 200 and 300. Those demanded at stores 1, 2, and 3 are 100, 200 and 50. Rather
than ship directly from sources to destinations, it I decided to investigate the
possibility of transshipment. Find the optimal shipping schedule. The transportation
costs per unit are given.
Factory
Factory
Source
1
2
1
2
3
1
0
6
7
1
8
2
6
0
2
5
9
1
7
5
0
1
7
Store
2
8
4
5
0
6
3
9
3
1
4
0
Problem – 3
Solve the following diagram by minimal spanning tree problem
2
5
3
6
4
Problem – 4
Solve the following diagram by shortest route algorithm
5
2
1
4
7
3
6
Problem – 5
Solve the following diagram by maximum flow problem
4
1
5
2
3
Problem – 6
Solve the following problems by B&B algorithm
Maximize Z = 2X1 + 3X2
Subject to
5X1 + 7X2 ≤ 35
4X1 + 9X2 ≤ 39
X1, X2 ≥ 0 and integer
Problem – 7
Solve the following problems by cutting plane method
Maximize Z = 2X1 + 3X2
Subject to
5X1 + 7X2 ≤ 35
4X1 + 9X2 ≤ 39
X1, X2 ≥ 0 and integer