| Article ID: | iaor19941138 |
| Country: | Switzerland |
| Volume: | 46/47 |
| Issue: | 1/4 |
| Start Page Number: | 393 |
| End Page Number: | 408 |
| Publication Date: | Dec 1993 |
| Journal: | Annals of Operations Research |
| Authors: | Kruse Hermann-Josef |
| Keywords: | degeneracy |
Degenerate optima in linear programming problems lead in a canonical way to so-called o-degeneracy graphs as subgraphs of degeneracy graphs induced by the set of optimal bases. Fundamental questions about the structure of o-degeneracy graphs suggest the closer inspection of some properties of these graphs, such as, for example, the connectivity and the complexity. Finally, some open questions are pointed out.