A monotonic build-up simplex algorithm for linear programming. (English) Zbl 0810.90089

Anstreicher, Kurt M.; Terlaky, Tamás

Oper. Res. 42, No. 3, 556-561 (1994).

Summary: We devise a new simplex pivot rule which has interesting theoretical properties. Beginning with a basic feasible solution, and any nonbasic variable having a negative reduced cost the pivot rule produces a sequence of pivots such that ultimately the originally chosen nonbasic variable enters the basis, and all reduced costs which were originally nonnegative remain nonnegative. The pivot rule thus monotonically builds up to a dual feasible, and hence optimal, basis. A surprising property is that the pivot sequence results in intermediate bases which are neither primal nor dual feasible. We prove the correctness of the procedure, and relate it to other pivoting rules for linear programming.

MSC:

90C05

Linear programming

Keywords:

simplex pivot rule