Abstract
The round-off errors tend to increase particularly rapidly after pivoting at “ill-conditioned” vertices. Those vertices where two or more hyperplanes, each representing one constraint, intersect at a very slight angle are considered as “ill-conditioned”. An “ill-conditioned” vertex is for instance given by the intersection of the two constraints:
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
© 1970 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Müller-Merbach, H. (1970). “Ill-Conditioned” Vertices. In: On Round-Off Errors in Linear Programming. Lecture Notes in Operations Research and Mathematical Systems, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95167-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-95167-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04960-9
Online ISBN: 978-3-642-95167-1
eBook Packages: Springer Book Archive