Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/s10287-009-0094-7 | Comput. Manag. Science |
Keywords | Field | DocType |
Linear programming,Dual simplex,Phase-1,Piecewise linear | Mathematical optimization,Simplex algorithm,Algorithm,Linear programming,Piecewise linear function,Mathematics,Computational analysis | Journal |
Volume | Issue | ISSN |
7 | 2 | 1619-697X |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
1 |
Name | Order | Citations | PageRank |
---|---|---|---|
István Maros | 1 | 31 | 5.84 |