The long step rule in the bounded-variable dual simplex method: Numerical experiments

The dual simplex algorithm is the method of choice when linear programs have to be reoptimized after adding constraints or fixing variables. In this paper we discuss a modification of the standard dual simplex which allows for taking longer steps when proceeding from one dual feasible solution to the other. We describe this long step rule and present computational results on NETLIB and MIPLIB problems.