The Average Number of Pivot Steps

  • Karl Heinz Borgwardt
Part of the Algorithms and Combinatorics book series (AC, volume 1)


Let us define what we mean by “average number of pivot steps” precisely. For this purpose consider the matrix of the input data
$$ {\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\frown}$}}{A}}: = \left[ \begin{gathered} a_1^T \hfill \\ . \hfill \\ a_m^T \hfill \\ {v^T} \hfill \\ \end{gathered} \right] \in {R^{{\left( {m + 1} \right)n}}} $$
of a problem
$$ \begin{gathered} Maximize\quad {v^T}x \hfill \\ subject\,to\quad a_1^Tx \leqslant 1,...,a_m^Tx \leqslant 1 \hfill \\ where\quad v,x,{a_1},...,{a_m} \in {R^n},m \geqslant n \hfill \\ \end{gathered} $$
We regard this matrix  as a random variable in a probability space
$$ \left( {{R^{{\left( {m + 1} \right)n}}},A,P} \right) $$
, Where A is the σ-algebra of the Lebesgue-measurable sets of R(m+1)n, and where P is a probability measure defined on A.


Random Vector Probability Space Intersection Plane Integral Formula Rotational Symmetry 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Karl Heinz Borgwardt
    • 1
  1. 1.Institute of MathematicsUniversity of AugsburgAugsburgWest Germany

Personalised recommendations