Abstract
Let us define what we mean by “average number of pivot steps” precisely. For this purpose consider the matrix of the input data
of a problem
We regard this matrix  as a random variable in a probability space
, 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Borgwardt, K.H. (1987). The Average Number of Pivot Steps. In: The Simplex Method. Algorithms and Combinatorics, vol 1. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61578-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-61578-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17096-9
Online ISBN: 978-3-642-61578-8
eBook Packages: Springer Book Archive