As a natural extension of the dual simplex algorithm, the dual face algorithm performed remarkably in computational experiments with a set of Netlib standard problems. In this paper, we generalize it to bounded-variable LP problems via local duality.
Citation
Department of Mathematics, Southeast University, Nanjing, 210096, China, 12/2014