Originally posted by: weekz28

I have a shortest path network problem and am trying to follow along with the network simplex solver iteration by iteration by checking the basis. However, when I call c.solution.basis.get_basis() it just shows that it adds one arc into the basis at each iteration and doesn't show any arcs leaving the basis. I am basically wanting to know how the solver works for the shortest path problem. If there is some documentation that could help me out that would be great.
#CPLEXOptimizers
#DecisionOptimization

Originally posted by: RWunderling

First off, you should be aware that restarting the Simplex Algorithm (regular or network) does not yield the same path as running it from start to end, but could exhibit dramatic difference, including infiniteness due to cycling when stopping and restarting.

About the question, I suggest to look at basis statuses for the columns and rows of your problem, or, equivalently, for the arcs and nodes.
#CPLEXOptimizers
#DecisionOptimization