Network_Simplex_Algorithm

Network_Simplex_Algorithm - 15.082 and 6.855J Network...

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

View Full Document Right Arrow Icon
1 15.082 and 6.855J Network Simplex Animations
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Calculating A Spanning Tree Flow 1 3 6 4 5 2 7 1 3 -6 -4 1 2 3 A tree with supplies and demands. (Assume that all other arcs have a flow of 0) What is the flow in arc (4,3)?
Background image of page 2
3 Calculating A Spanning Tree Flow 1 3 6 4 5 2 7 1 3 -6 -4 1 2 3 To calculate flows, iterate up the tree, and find an arc whose flow is uniquely determined. What is the flow in arc (5,3)? 2
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Calculating A Spanning Tree Flow 1 3 6 4 5 2 7 1 3 -6 -4 1 2 3 What is the flow in arc (3,2)? 2 3
Background image of page 4
5 Calculating A Spanning Tree Flow 1 3 6 4 5 2 7 1 3 -6 -4 1 2 3 What is the flow in arc (2,6)? 2 3 6
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 Calculating A Spanning Tree Flow 1 3 6 4 5 2 7 1 3 -6 -4 1 2 3 What is the flow in arc (7,1)? 2 3 6 4
Background image of page 6
7 Calculating A Spanning Tree Flow 1 3 6 4 5 2 7 1 3 -6 -4 1 2 3 What is the flow in arc (1,6)? 2 3 6 4 3
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 Calculating A Spanning Tree Flow 1 3 6 4 5 2 7 1 3 -6 -4 1 2 3 Note : there are two different ways of calculating the flow on (1,2), and both ways give a flow of 4. Is this a coincidence? 2 3 6 4 4 3
Background image of page 8
9 Calculating Simplex Multipliers for a Spanning Tree 1 3 6 4 5 2 7 5 -6 -2 -4 1 3 Here is a spanning tree with arc costs. How can one choose node potentials so that reduced costs of tree arcs is 0? Recall: the reduced cost of (i,j) is ij i j
Background image of page 9

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

View Full DocumentRight Arrow Icon
10 1 3 6 4 5 2 7 5 -6 -2 -4 1 3 What is the simplex multiplier for node 2? There is a redundant constraint in the minimum cost flow problem. 0 Calculating Simplex Multipliers for a Spanning Tree
Background image of page 10
11 Calculating Simplex Multipliers for a Spanning Tree 1 3 6 4 5 2 7 5 -6 -2 -4 1 3 What is the simplex multiplier for node 7? 0
Background image of page 11

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

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

This note was uploaded on 05/05/2010 for the course EE 15.082 taught by Professor Orlin during the Spring '10 term at Visayas State University.

Page1 / 45

Network_Simplex_Algorithm - 15.082 and 6.855J Network...

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

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