| Article ID: | iaor19941132 |
| Country: | Switzerland |
| Volume: | 46/47 |
| Issue: | 1/4 |
| Start Page Number: | 249 |
| End Page Number: | 269 |
| Publication Date: | Dec 1993 |
| Journal: | Annals of Operations Research |
| Authors: | Armand Paul |
| Keywords: | degeneracy |
Finding the incident edges to a degenerate vertex of a polyhedron is a non-trivial problem. So pivoting methods generally involve a perturbation argument to overcome the degeneracy problem. But the perturbation entails a bursting of each degenerate vertex into a cluster of nondegenerate vertices. The aim of this paper is to give some bounds on the number of these perturbed vertices.