IELM 202, Assignment #4
Due date: 9 November 2005, Wednesday, 12:00 noon
Question 1 (20 marks):
Consider the maximum flow problem as below, where the source is node A and the sink
is node F, and the arc capacity are the numbers shown next to the directed arcs.
Use the augmenting path algorithm to solve this problem. Please show the iterations of
the algorithm.
Question 2 (20 marks)
:
The Texago Corporation had four oil fields, four refineries, and four distribution centers.
A major strike involving the transportation industries now has sharply curtailed Texago’s
capacity to ship oil from the oil fields to the refineries and to ship petroleum products
from the refineries to the distribution centers. Using units to the thousands of barrels of
crude oil (and its equivalent in refined products), the following tables show the maximum
number of units that can be shipped per day from each oil field to each refinery, and from
each refinery to each distribution center.
Refinery
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Fall '10
 D
 Distribution center, Maximum flow problem, oil fields, Oil field, distribution centers

Click to edit the document details