External Links

    Journal: Math. Program.

    Volume 35, Issue 2

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