The expected number of extreme points of a random linear program Sancho E. BerenguerRobert L. Smith OriginalPaper Pages: 129 - 134
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm Nimrod Megiddo OriginalPaper Pages: 140 - 172
Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems Michael J. Todd OriginalPaper Pages: 173 - 192
Low order polynomial bounds on the expected performance of local improvement algorithms Craig A. Tovey OriginalPaper Pages: 193 - 224
On the expected number of linear complementarity cones intersected by random and semi-random rays Nimrod Megiddo OriginalPaper Pages: 225 - 235
On the average speed of Lemke's algorithm for quadratic programming Yieh-Hei Wan OriginalPaper Pages: 236 - 246