Erratum: Probabilistic Models for Linear Programming

In the paper “Probabilistic models for linear programming,” published in Mathematics of Operations Research, Vol. 16, No. 4, pp. 671–693, the author proposed various models for generating random linear programming problems and investigated several properties of these models, including the probability that the feasible region is bounded, the distribution of the distance from a particular interior point to each constraint hyperplane, and some properties of the vertices of the feasible region. Unfortunately, one of the results about these vertices is incorrect, and this affects some of the corollaries. Here it is described what is invalid, and explained where the difficulty arises in the proof.