In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type:<Equation ID="Equ1"> <EquationSource Format="TEX"/> </Equation> We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a <Subscript>1</Subscript>,…,a <Subscript>m</Subscript>, v be distributed independently,...</subscript></subscript></equation>

<Para ID="Par1">This paper deals with the average-case-analysis of the number of pivot steps required by the simplex method. It generalizes results of Borgwardt (who worked under the assumpution of the rotation-symmetry-model) for the shadow-vertex-algorithm to so-called cylindric distributions. Simultaneously...</para>

In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type: We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a 1 ,…,a m , v be distributed independently,...