A New Network Simplex Algorithm To Reduce Consecutive Degenerate Pivots and Prevent Stalling

It is well known that in operations research, degeneracy can cause a cycle in a network simplex algorithm which can be prevented by maintaining strong feasible bases in each pivot. also, in a network consists of n arcs and m nodes, not considering any new conditions on the entering variable, the upper bound of consecutive degenerate pivots is equal (n-m+k, k )where k is the number of degenerate arcs in the basis. as well as, the network simplex algorithm may stall if it goes through some long consecutive degenerate pivot. through conditions such as (lrc) and (lrs) upon entering variable rules, this upper bound can be reduced to mn and m^2 respectively. in this current paper we first suggest a new algorithm for anti-stalling in which a new condition is provided to the entering variable and then show that through this algorithm there are at most k consecutive degenerate pivots