Introduces a facet pivot simplex method for linear programming and reports that numerical tests show it is promising compared to the standard vertex pivot method.
Yang, A double-pivot simplex algorithm and its upper bounds of the iteration numbers, Research in the Mathematical Sciences, 7, 34, (2020)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2021 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the facet pivot simplex method for linear programming
Introduces a facet pivot simplex method for linear programming and reports that numerical tests show it is promising compared to the standard vertex pivot method.