Index Terms
- Improved dual network simplex
Recommendations
Polynomial dual network simplex algorithms
We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m2 logn) bound on the number of pivots, ...
The positive edge pricing rule for the dual simplex
In this paper, we develop the two-dimensional positive edge criterion for the dual simplex. This work extends a similar pricing rule implemented by Towhidi et al. (2014) 24] to reduce the negative effects of degeneracy in the primal simplex. In the dual ...
Improved Primal Simplex: A More General Theoretical Framework and an Extended Experimental Analysis
In this article, we propose a general framework for an algorithm derived from the primal simplex that guarantees a strict improvement in the objective after each iteration. Our approach relies on the identification of compatible variables that ensure a ...
Comments