MIE376 Lec 10 - NP Slides(1).page12

MIE376 Lec 10 - NP Slides(1).page12 - Complex to derive...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
12 A few words about Network Simplex Algorithm inspired by simplex Solved on the graph – or digital tree equivalent Basic arc has flow between bounds Non-basic arc has flow at upper or lower bound Degenerate solutions are prevalent Entering arc based on duality theory Departing arc based on graph theory
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Complex to derive – simple to execute Performance is 200-300 times faster! See “LP and Network Flows” by Bazaraa et. al. pg. 419 Some Commercial packages exploit network structure in LP Integer Bounds and Injections Integer Solutions...
View Full Document

This note was uploaded on 07/10/2011 for the course MIE 376 taught by Professor Daniel during the Spring '11 term at University of Toronto.

Ask a homework question - tutors are online