Must has decided to reconstruct the sidewalks throughout the east side of its campus to provide wheelchair access.

However, upgrading sidewalks is a very expensive undertaking, so far the first phase of this project, university admin
want to make sure they connect all buildings with wheelchair access with the minimum number of refurbished sidew
possible. Below is the minimal spanning tree network of existing sidewalks on the east side of the campus, with the

Total number of feet of sidewalk: 1086

 us to provide wheelchair access.
of this project, university administrators
mum number of refurbished sidewalks
ast side of the campus, with the feet between each building.
A manufacturing company produces different variations of a product at different work centers in its plant on a daily
showing the various work center in the plant, the daily capacities at each work center, and the flow of the partially c
between work centers:

Node 1 represents the point where raw materials enter the process, and node 15 is the packaging and distribution c
Determine the maximum number of units that can be completed each day and the number of units processed at ea

Paths Minimum Number of Units

1-2-9-12-15 45
1-3-6-12-15 30
1-3-7-6-12-15 15
1-3-7-6-10-12-13-15 5
1-2-6-10-13-15 25
1-4-7-6-10-12-13-15 30
1-4-7-10-13-15 5
1-4-8-13-15 25
1-5-8-14-15 40
1-5-11-14-15 30

TOTAL: 250
The diagram above shows the path and number of units entering and leaving for each node.

Summary:

Maximum number of units that can be completed each day: 250

Number of units processed in: Number of units that passes each arc:
Node 1 250 Arc Units Arc
Node 2 70 1 to 2 70 7 to 10
Node 3 50 1 to 3 50 7 to 8
Node 4 60 1 to 4 60 8 to 11
Node 5 70 1 to 5 70 8 to 13
Node 6 105 2 to 6 25 8 to 14
Node 7 55 2 to 9 45 9 to 12
Node 8 65 3 to 6 30 10 to 12
Node 9 45 3 to 7 20 10 to 13
Node 10 65 4 to 7 35 11 to 14
Node 11 30 4 to 8 25 12 to 13
Node 12 125 5 to 8 40 12 to 15
Node 13 90 5 to 11 30 13 to 15
Node 14 70 6 to 12 45 14 to 15
Node 15 250 6 to 10 60
rk centers in its plant on a daily basis. Below is network
er, and the flow of the partially completed products

the packaging and distribution center.

number of units processed at each work center.
asses each arc:
Units
5
0
0
25
40
45
35
30
30
35
90
90
70
A compressor company has plants in three location: Cleveland, Chicago, and Boston. During the past week the
total production of a special compressor unit out of each plant has been 35, 50 and 40 units respectively. The
company wants to ship 45 units to a distribution center in Dallas, 20 to Atlanta, 30 to San Fracisco, and 30 to
Philadelphia. The unit production and distribution costs from each plant to each distribution center are given
in the table below. Formulate this problem as a minimum cost flow problem to determine the best shipping
strategy to follow.

Diagram Representation

A - Cleveland D - Dallas G - Philadelphia

B - Chicago E- Atlanta
C- Boston F - San Francisco

Conclusion:

The best shipping strategy is as follows:

10 units from Cleveland to Atlanta. 25 units from Cleveland to San Francisco. 45 units from Chicago to Da
10 units from Boston to Atlanta. 30 units from Boston to Philadelphia.
. During the past week the
40 units respectively. The
o San Fracisco, and 30 to
tribution center are given
rmine the best shipping

XAD 0 35 = 35
XAE 10 50 = 50
XAF 25 40 = 40
XAG 0 -45 = -45
XBD 45 -20 = -20
XBE 0 -30 = -30
XBF 5 -30 = -30
XBG 0
XCD 0
XCE 10
XCF 0
XCG 30

Z= 1020

sco. 45 units from Chicago to Dallas. 5 units from Chicago to San Francisco.