Chapter 8 Problems+6_7_13_page430

Chapter 8 Problems+6_7_13_page430 - the network. Replace...

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

View Full Document Right Arrow Icon
Problem 6 (p. 430). See figure. If the maximum flow = 21, then all packages can be loaded. Problem 7 (p. 430). See figure.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Problem 13 (p. 431). Suppose we know the flow into node i cannot exceed 10 units. Add a new node, node i', to
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: the network. Replace each arc of the form (j,i) in the original network with an arc (j,i') and add an arc (with capacity 10 units) (i',i). This will ensure that at most 10 units flow into node i....
View Full Document

This note was uploaded on 12/14/2010 for the course ESI 6314 taught by Professor Vladimirlboginski during the Fall '09 term at University of Florida.

Page1 / 2

Chapter 8 Problems+6_7_13_page430 - the network. Replace...

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