Kostina, Ekaterina - In: Mathematical Methods of Operations Research 55 (2002) 3, pp. 413-429
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 modication of the standard dual simplex which allows for taking longer steps when proceeding from one dual feasible solution to...