A Las Vegas algorithm for linear programming when the dimension is small
Kenneth L. Clarkson · 1988
An algorithm for solving linear programming problems is given. The expected number of arithmetic operations required by the algorithm is given. The expectation is with respect to the random choices made by the algorithm, and the bound holds for any given input. The technique can be extended to other convex programming problems.>