IELM_assignment_4

IELM_assignment_4 - IELM 202, Assignment #4 Due date: 9...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
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
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

IELM_assignment_4 - IELM 202, Assignment #4 Due date: 9...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online