Computational study of the GDPO dual phase-1 algorithm

The GDPO algorithm for phase-1 of the dual simplex method developed by Maros possesses some interesting theoretical features that have potentially huge computational advantages. This paper gives account of a computational analysis of GDPO that has investigated how these features work in practice by exploring the internal operation of the algorithm. Experience of a systematic study involving 48 problems gives an insight how the predicted performance advantages materialize that ultimately make GDPO an indispensable tool for dual phase-1.