Abstract
In the previous chapter, we discussed what it means when the ratios computed to calculate the leaving variable are all nonpositive (the problem is unbounded). In this chapter, we take up the more delicate issue of what happens when some of the ratios are infinite (i.e., their denominators vanish).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hoffman, A. (1953), Cycling in the simplex algorithm, Technical Report 2974, National Bureau of Standards.
Marshall, K. & Suurballe, J. (1969), ‘A note on cycling in the simplex method’, Naval Research Logistics Quarterly 16, 121–137.
Charnes, A. (1952), ‘Optimality and degeneracy in linear programming’, Econometrica 20, 160–170.
Dantzig, G., Orden, A. & Wolfe, P. (1955), ‘The generalized simplex method for minimizing a linear form under linear inequality constraints’, Pacific Journal of Mathematics 5, 183–195.
Bland, R. (1977), ‘New finite pivoting rules for the simplex method’, Mathematics of Operations Research 2, 103–107.
Gal, T., ed. (1993), Degeneracy in Optimization Problems, Vol. 46/47 of Annals of Operations Research, J.C. Baltzer AG.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2008 Robert J.Vanderbei
About this chapter
Cite this chapter
Vanderbei, R.J. (2008). Degeneracy. In: Linear Programming. International Series in Operations Research & Management Science, vol 114. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74388-2_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-74388-2_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74387-5
Online ISBN: 978-0-387-74388-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)