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.
Beale, (1955), Cycling in the dual simplex method, Naval Res earch Logis- tics Quarterly, 2(4), 269–75
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.