Summary
The article provides an asymptotic probabilistic analysis of the variance of the number of pivot steps required by phase II of the “shadow vertex algorithm” — a parametric variant of the simplex algorithm. The analysis is done for data that satisfy a spherically symmetric distribution law in the n-dimensional unit ball.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borgwardt, K. H.: The Simplex Method—A Probabilistic Analysis. Springer, New York, Berlin, Heidelberg (1987)
Borgwardt, K. H.: Verschärfung des Polynomialitätsbeweises für die erwartete Anzahl von Schattenecken im Rotationssymmetrie-Modell. Shaker, Aachen (1994)
Feller, W.: An Introduction to Probability and its Applications, Vol I–II. Wiley, New York ( 1960, 1966 )
Küfer, K.-H.: On the Variance of the Number of Pivot Steps Required by the Simplex Algorithm. To appear in ZOR
Shamir, R.: The Efficiency of the Simplex Method: A Survey. Management Science 33 (1987) 241–262
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Küfer, KH. (1995). Recent Developments in the Probabilistic Analysis of the Simplex Algorithm. In: Derigs, U., Bachem, A., Drexl, A. (eds) Operations Research Proceedings 1994. Operations Research Proceedings, vol 1994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-79459-9_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-79459-9_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58793-4
Online ISBN: 978-3-642-79459-9
eBook Packages: Springer Book Archive