This procedure and the dual simplex method are then incorporated into a general purpose algorithm; then, a modification of it using a perturbation technique is made in order to handle highly ...

Moreover, a new, ratio-test-free pivoting rule is proposed, significantly reducing computational cost at each iteration. Our numerical experiments show that the method is very promising, at least for ...

The book also addresses linear programming duality theory and its use in algorithm design as well as the Dual Simplex Method, Dantzig-Wolfe decomposition, and a primal-dual interior point algorithm.