degeneracy - Maintaining a strongly feasible spanning tree...

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

View Full Document Right Arrow Icon
If there is more than one candidate for the leaving arc, then for each candidate arc ij , x’ ij = 0 . Only one of the candidate arcs leaves the tree, so the new solution has x’ ij =0 for at least one of its tree arcs. Such a solution is called a degenerate solution. They could lead to pivots with t = x f = 0 , that is no decrease in the cost. Degeneracy is necessary but not sufficient for cycling.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Maintaining a strongly feasible spanning tree guarantees finite termination and speeds up the running time A pivot iteration is non-degenerate if > 0 and is degenerate if = 0 A degenerate iteration occurs only if T is a degenerate spanning tree. If two arcs tie while determining the value of , the next spanning tree will be degenerate....
View Full Document

Ask a homework question - tutors are online