{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:04:12Z","timestamp":1694624652927},"reference-count":106,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf02096258","type":"journal-article","created":{"date-parts":[[2005,9,12]],"date-time":"2005-09-12T18:23:22Z","timestamp":1126549402000},"page":"81-105","source":"Crossref","is-referenced-by-count":8,"title":["Degeneracy graphs: theory and application an updated survey"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Tomas","family":"Gal","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02096258_CR1","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1057\/jors.1984.83","volume":"35","author":"M. Akg\u00fcl","year":"1984","unstructured":"M. Akg\u00fcl, A note on shadow prices in linear programminig, J. Oper. Res. Soc. 35 (1984) 425\u2013431.","journal-title":"J. Oper. Res. Soc."},{"key":"BF02096258_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF02242366","volume":"15","author":"W. Altherr","year":"1975","unstructured":"W. Altherr, An algorithm for enumerating all vertices of a convex polyhedron, Computing 15 (1975) 181\u2013193.","journal-title":"Computing"},{"key":"BF02096258_CR3","first-page":"217","volume":"12","author":"M. Altman","year":"1964","unstructured":"M. Altman, Optimum simplex methods and degeneracy in linear programming, Bull. de l'Acad. Polon. des Sci. 12 (1964) 217\u2013225.","journal-title":"Bull. de l'Acad. Polon. des Sci."},{"key":"BF02096258_CR4","unstructured":"P. Armand, Programmation lin\u00e9aire multicrit\u00e8re et probl\u00e8mes de la d\u00e9g\u00e9n\u00e9rescence, Th\u00e8se de Doctorat de l'Universit\u00e9 de Limoges (1991)."},{"key":"BF02096258_CR5","doi-asserted-by":"crossref","unstructured":"P. Armand, Bounds for the number of vertices of perturbed polyhedra, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02023098"},{"key":"BF02096258_CR6","series-title":"Technical Report","volume-title":"On the nonequivalence of shadow prices and dual variables","author":"D.C. Aucamp","year":"1979","unstructured":"D.C. Aucamp and D.I. Steinberg, On the nonequivalence of shadow prices and dual variables, Technical Report WUCS-79-11, Dept. of Computer Sciences, Washington University, St. Louis, MS (1979)."},{"key":"BF02096258_CR7","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1057\/jors.1982.118","volume":"33","author":"D.C. Aucamp","year":"1982","unstructured":"D.C. Aucamp and D.I. Steinberg, The computation of shadow prices in linear programming, J. Oper. Res. 33 (1982) 557\u2013565.","journal-title":"J. Oper. Res."},{"key":"BF02096258_CR8","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BFb0121192","volume":"8","author":"D. Avis","year":"1978","unstructured":"D. Avis and V. Chv\u00e1tal, Notes on Bland's pivoting rule, Math. Progr. Study 8 (1978) 24\u201334.","journal-title":"Math. Progr. Study"},{"key":"BF02096258_CR9","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01386081","volume":"6","author":"A.G. Azpeitia","year":"1964","unstructured":"A.G. Azpeitia and D.J. Dickinson, A decision rule in the simplex method that avoids cycling, Numer. Mathematik 6 (1964) 329\u2013331.","journal-title":"Numer. Mathematik"},{"key":"BF02096258_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/0109008","volume":"9","author":"M.L. Balinski","year":"1961","unstructured":"M.L. Balinski, An algorithm for finding all vertices of convex polyhedral sets, J. Soc. Ind. Appl. Math. 9 (1961) 72\u201388.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"BF02096258_CR11","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/BF01580885","volume":"35","author":"M.L. Balinski","year":"1986","unstructured":"M.L. Balinski, Th.M. Liebling and A.-E. Nobs, On the average length of lexicographic paths, Math. Progr. 35 (1986) 362\u2013364.","journal-title":"Math. Progr."},{"key":"BF02096258_CR12","doi-asserted-by":"crossref","unstructured":"B. Bank, J. Guddat, D. Klatte, B. Kummer and K. Tammer,Non-Linear Parametric Optimization (Akademie Verlag, 1982).","DOI":"10.1007\/978-3-0348-6328-5"},{"key":"BF02096258_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01584319","volume":"13","author":"R.S. Barr","year":"1977","unstructured":"R.S. Barr, F. Glover and D. Klingman, The alternating basis algorithm for assignment problems, Math. Progr. 13 (1977) 1\u201313.","journal-title":"Math. Progr."},{"key":"BF02096258_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0377-2217(78)90110-8","volume":"2","author":"R.S. Barr","year":"1978","unstructured":"R.S. Barr, F. Glover and D. Klingman, The generalized alternating path algorithm for transportation problems, Eur. J. Oper. Res. 2 (1978) 137\u2013144.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096258_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1002\/nav.3800020406","volume":"2","author":"E.M.L. Beale","year":"1955","unstructured":"E.M.L. Beale, Cycling in the dual simplex algorithm, Naval Res. Log. Quart. 2 (1955) 269\u2013276.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096258_CR16","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BF01584344","volume":"13","author":"M. B\u00e9nichou","year":"1977","unstructured":"M. B\u00e9nichou, J.M. Gauthier, G. Hentges and G. Ribi\u00e8re, The efficient solution of large-scale linear programming problems \u2014 some algorithmic techniques and computational results, Math. Progr. 13 (1977) 280\u2013322.","journal-title":"Math. Progr."},{"key":"BF02096258_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1287\/moor.2.2.103","volume":"2","author":"R.G. Bland","year":"1977","unstructured":"R.G. Bland, New finite pivoting rules for the simplex method, Math. Oper. Res. 2 (1977) 103\u2013107.","journal-title":"Math. Oper. Res."},{"key":"BF02096258_CR18","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1017\/S1446788700039513","volume":"43","author":"N. Cameron","year":"1987","unstructured":"N. Cameron, Stationarity in the simplex method, J. Austral. Math. Soc., Series A 43 (1987) 137\u2013142.","journal-title":"J. Austral. Math. Soc., Series A"},{"key":"BF02096258_CR19","doi-asserted-by":"publisher","first-page":"160","DOI":"10.2307\/1907845","volume":"20","author":"A. Charnes","year":"1952","unstructured":"A. Charnes, Optimality and degeneracy in linear programming, Econometrica 20 (1952) 160\u2013170.","journal-title":"Econometrica"},{"key":"BF02096258_CR20","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/BF01581644","volume":"19","author":"M.C. Cheng","year":"1980","unstructured":"M.C. Cheng, New criteria for the simplex algorithm, Math. Progr. 19 (1980) 230\u2013236.","journal-title":"Math. Progr."},{"key":"BF02096258_CR21","unstructured":"V. Chv\u00e1tal,Linear Programming (Freeman, 1983)."},{"key":"BF02096258_CR22","unstructured":"M. Cirina, Remarks on a recent simplex pivoting rule, in:Methods of Operations Research 55: Proc. 9th Symp. on Operations Research, K\u00f6nigsstein\/Ts, ed. W. Domschke et al. (1985) pp. 187\u2013199."},{"key":"BF02096258_CR23","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"W.H. Cunningham, Theoretical properties of the network simplex method, Math. Oper. Res. 4 (1979) 196\u2013208.","journal-title":"Math. Oper. Res."},{"key":"BF02096258_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/BF02592054","volume":"26","author":"W.H. Cunningham","year":"1983","unstructured":"W.H. Cunningham and J.G. Klincewicz, On cycling in the network simplex method, Math. Progr. 26 (1983) 182\u2013189.","journal-title":"Math. Progr."},{"key":"BF02096258_CR25","doi-asserted-by":"crossref","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, 1963).","DOI":"10.7249\/R366"},{"issue":"115","key":"BF02096258_CR26","first-page":"81","volume":"114","author":"G.B. Dantzig","year":"1989","unstructured":"G.B. Dantzig, Making a progress during a stall in the simplex method, Lin. Alg. Appl. 114\/115 (1989) 81\u201396.","journal-title":"Lin. Alg. Appl."},{"key":"BF02096258_CR27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","volume":"5","author":"G.B. Dantzig","year":"1955","unstructured":"G.B. Dantzig, A. Orden and P. Wolfe, The generalized simplex method for minimizing a linear form under linear inequality restraints, Pacific J. Math. 5 (1955) 183\u2013195.","journal-title":"Pacific J. Math."},{"key":"BF02096258_CR28","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF01593771","volume":"12","author":"M.E. Dyer","year":"1977","unstructured":"M.E. Dyer and L.G. Proll, An algorithm for determining all extreme points of a convex polytope, Math. Progr. 12 (1977) 81\u201396.","journal-title":"Math. Progr."},{"key":"BF02096258_CR29","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0377-2217(82)90180-1","volume":"9","author":"M.E. Dyer","year":"1982","unstructured":"M.E. Dyer and L.G. Proll, An improved vertex enumeration algorithm, Eur. J. Oper. Res. 9 (1982) 359\u2013368.","journal-title":"Eur. J. Oper. Res."},{"key":"BF02096258_CR30","unstructured":"J.G. Ecker and M. Kupferschmied,Introduction to Operations Research (Wiley, 1988)."},{"key":"BF02096258_CR31","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1016\/0305-0483(74)90122-4","volume":"2","author":"A. Eilon","year":"1974","unstructured":"A. Eilon and R. Flavell, Note on \u201cmany-sided shadow prices\u201d, OMEGA 2 (1974) 821\u2013823.","journal-title":"OMEGA"},{"key":"BF02096258_CR32","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1111\/j.1467-9574.1985.tb01152.x","volume":"39","author":"H.A. Eiselt","year":"1985","unstructured":"H.A. Eiselt and C.-L. Sandblom, External pivoting in the simplex algorithm, Statistica Neerlandica 39 (1985) 327\u2013341.","journal-title":"Statistica Neerlandica"},{"key":"BF02096258_CR33","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1111\/j.1540-5915.1982.tb00155.x","volume":"13","author":"J.R. Evans","year":"1982","unstructured":"J.R. Evans and N.R. Baker, Degeneracy and the (mis)interpretation of sensitivity analysis in linear programming, Dec. Sci. 13 (1982) 348\u2013354.","journal-title":"Dec. Sci."},{"key":"BF02096258_CR34","unstructured":"R. Fletcher, Degeneracy in the presence of round-off errors, Techn. Rep. NA\/89, Dept. of Math. Sci., University of Dundee (1989)."},{"key":"BF02096258_CR35","unstructured":"B. Fleischmann, Duale und primale Schnittebeneverfahren in der ganzzahligen linearen Optimierung, Dissertation, Universit\u00e4t Hamburg (1970)."},{"key":"BF02096258_CR36","unstructured":"T. Gal, Determination of all neighbours of a degenerate extreme point in polytopes, Working Paper No. 17b, FB Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1978)."},{"key":"BF02096258_CR37","unstructured":"T. Gal,Postoptimal Analyses, Parametric Programmiing, and Related Topics (McGraw-Hill, 1979)."},{"key":"BF02096258_CR38","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BF00939135","volume":"45","author":"T. Gal","year":"1985","unstructured":"T. Gal, On the structure of the set bases of a degenerate point, J. Optim. Theory Appl. 45 (1985) 577\u2013589.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02096258_CR39","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01719736","volume":"8","author":"T. Gal","year":"1986","unstructured":"T. Gal, Shadow prices and sensitivity analysis in linear programming under degeneracy \u2014 State-of-the-art survey, OR Spektrum 8 (1986) 59\u201371.","journal-title":"OR Spektrum"},{"key":"BF02096258_CR40","doi-asserted-by":"crossref","unstructured":"T. Gal, Weakly redundant constraints and their impact on postoptimal analyses, Eur. J. Oper. Res. (1992) 315\u2013326.","DOI":"10.1016\/0377-2217(92)90083-L"},{"key":"BF02096258_CR41","first-page":"3","volume":"6","author":"T. Gal","year":"1990","unstructured":"T. Gal, Degeneracy in mathematical programming and degeneracy graphs, ORiON 6 (1990) 3\u201336.","journal-title":"ORiON"},{"key":"BF02096258_CR42","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0167-6377(92)90058-B","volume":"11","author":"T. Gal","year":"1992","unstructured":"T. Gal and F. Geue, A new pivoting rule for solving various degeneracy problems, Oper. Res. Lett. 11 (1992) 23\u201332.","journal-title":"Oper. Res. Lett."},{"key":"BF02096258_CR43","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF01589397","volume":"42","author":"T. Gal","year":"1988","unstructured":"T. Gal, H.-J. Kruse and P. Z\u00f6rnig, Survey of solved and open problems in the degeneracy phenomenon, Math. Progr. 42 (1988) 125\u2013133.","journal-title":"Math. Progr."},{"key":"BF02096258_CR44","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1287\/opre.27.4.848","volume":"27","author":"S.I. Gass","year":"1979","unstructured":"S.I. Gass, Comments on the possibility of cycling with the simplex method, Oper. Res. 27 (1979) 848\u2013852.","journal-title":"Oper. Res."},{"key":"BF02096258_CR45","unstructured":"S.I. Gass,Linear Programming: Methods and Applications, 3rd ed. (McGraw-Hill, 1985)."},{"key":"BF02096258_CR46","unstructured":"S.I. Gass, private communication (1989)."},{"key":"BF02096258_CR47","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1002\/nav.3800110104","volume":"11","author":"B.J. Gassner","year":"1964","unstructured":"B.J. Gassner, Cycling in the transportation problem, Naval Res. Log. Quart. 11 (1964) 43\u201358.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096258_CR48","unstructured":"D.M. Gay, Electronic mail distribution of linear programming test problems, Math. Progr. Soc. COAL Newsletters (1985)."},{"key":"BF02096258_CR49","unstructured":"F. Geue, Eine neue Pivot-Auswahlregel und die durch sie induzierten Teilgraphen des positiven Entartungsgraphen, Working Paper No. 141, FB Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1989)."},{"key":"BF02096258_CR50","unstructured":"F. Geue, Eckenabsuchende Verfahren unter Entartung: Theorie, Algorithmen und Vergleichstests (Vertex searching methods under degeneracy: Theory, algorithms and computational comparisons), Dissertation, FernUniversit\u00e4t Hagen (1993), to be published."},{"key":"BF02096258_CR51","doi-asserted-by":"crossref","unstructured":"F. Geue, An improved N-tree method to determine all neighbors of a degenerate vertex, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02023105"},{"key":"BF02096258_CR52","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P.E. Gill","year":"1989","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, A practical anti-cycling procedure for linearly constrained optimization, Math. Progr. 45 (1989) 437\u2013474.","journal-title":"Math. Progr."},{"key":"BF02096258_CR53","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Numerical Linear Algebra and Optimization, Vol. 1 (Addison-Wesley, 1991)."},{"key":"BF02096258_CR54","unstructured":"R. G\u00f6tz, Verfahren zur Konstruktion von Beispielen zum Simplexzykeln und ihre Implementierung, Diplomarbeit, Fachbereich Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1989)."},{"key":"BF02096258_CR55","unstructured":"R. G\u00f6tz, private communication (1991)."},{"key":"BF02096258_CR56","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1002\/nav.3800330409","volume":"33","author":"H.J. Greenberg","year":"1986","unstructured":"H.J. Greenberg, An analysis of degeneracy, Naval Res. Log. Quart. 33 (1986) 635\u2013655.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096258_CR57","unstructured":"B. Gr\u00fcnbaum,Convex Polytopes (Wiley, 1967)."},{"key":"BF02096258_CR58","unstructured":"G. Hadley,Linear Programming (Addison-Wesley, 1975)."},{"key":"BF02096258_CR59","first-page":"135","volume":"42","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, Pivot selection methods of the DEVEX LP code, Math. Progr. 42 (1973) 135\u2013145.","journal-title":"Math. Progr."},{"key":"BF02096258_CR60","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01589398","volume":"72","author":"R.S. Hattersley","year":"1988","unstructured":"R.S. Hattersley and J. Wilson, A dual approach to primal degeneracy, Math. Progr. 72 (1988) 135\u2013176.","journal-title":"Math. Progr."},{"key":"BF02096258_CR61","unstructured":"A.J. Hoffman, Cycling in the simplex algorithm, National Bureau of Standards Report No. 2974 (1953)."},{"key":"BF02096258_CR62","doi-asserted-by":"crossref","unstructured":"M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts,Redundancy in Mathematical Programming: A State-of-the-Art Survey, Lecture Notes in Economics and Mathematical Systems No. 206 (Springer, 1983).","DOI":"10.1007\/978-3-642-45535-3"},{"key":"BF02096258_CR63","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02187776","volume":"5","author":"V. Klee","year":"1990","unstructured":"V. Klee and P. Kleinschmidt, Geometry of the Gass-Saaty parametric cost LP algorithm, Discr. Comp. Geom. 5 (1990) 13\u201326.","journal-title":"Discr. Comp. Geom."},{"key":"BF02096258_CR64","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0305-0483(76)90124-9","volume":"4","author":"G. Knolmayer","year":"1976","unstructured":"G. Knolmayer, How many sided are shadow prices at degenerate primal optima?, OMEGA 4 (1976) 493\u2013494.","journal-title":"OMEGA"},{"key":"BF02096258_CR65","doi-asserted-by":"crossref","unstructured":"G. Knolmayer,Programmierungsmodelle f\u00fcr die Produktionsprogrammplanung (Birkh\u00e4user, 1980).","DOI":"10.1007\/978-3-0348-5813-7"},{"key":"BF02096258_CR66","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1111\/j.1540-5915.1984.tb01193.x","volume":"15","author":"G. Knolmayer","year":"1984","unstructured":"G. Knolmayer, The effect of degeneracy on cost-coefficient ranges and an algorithm to resolve interpretation problems, Dec. Sci. 15 (1984) 14\u201321.","journal-title":"Dec. Sci."},{"key":"BF02096258_CR67","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/359423.359433","volume":"20","author":"T.C.T. Kotiah","year":"1977","unstructured":"T.C.T. Kotiah and D.I. Steinberg, Occurrences of cycling and other phenomena arising in a class of linear programming models, Commun. ACM 20 (1977) 107\u2013112.","journal-title":"Commun. ACM"},{"key":"BF02096258_CR68","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1287\/opre.26.2.374","volume":"26","author":"T.C.T. Kotiah","year":"1978","unstructured":"T.C.T. Kotiah and D.I. Steinberg, On the possibility of cycling with the simplex method, Oper. Res. 26 (1978) 374\u2013376.","journal-title":"Oper. Res."},{"key":"BF02096258_CR69","doi-asserted-by":"crossref","unstructured":"H.-J. Kruse,Degeneracy Graphs and the Neighbourhood Problem, Lecture Notes in Economics and Mathematical Systems No. 260 (Springer, 1986).","DOI":"10.1007\/978-3-642-49270-9"},{"key":"BF02096258_CR70","unstructured":"H.-J. Kruse, \u00dcber spezielle Teilgraphen von Entartungsgraphen, Working Paper No. 121, Fachbereich Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1987)."},{"key":"BF02096258_CR71","doi-asserted-by":"crossref","unstructured":"H.-J. Kruse, On some properties of o-degeneracy graphs, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02023106"},{"key":"BF02096258_CR72","unstructured":"H.W. Kuhn, Loc. Cit. [51]."},{"key":"BF02096258_CR73","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01580770","volume":"41","author":"T.L. Magnanti","year":"1988","unstructured":"T.L. Magnanti and J.B. Orlin, Parametric linear programming and anti-cycling pivoting rules, Math. Progr. 41 (1988) 317\u2013325.","journal-title":"Math. Progr."},{"key":"BF02096258_CR74","unstructured":"A. Majthay, On degeneracy and cycling with the simplex method, Disc. Paper No. 41, Center for Econometrics and Decision Sciences, University of Florida (1981)."},{"key":"BF02096258_CR75","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1002\/nav.3800160110","volume":"16","author":"K.T. Marshall","year":"1969","unstructured":"K.T. Marshall and J.W. Suurballe, A note on cycling in the simplex method, Naval Res. Log. Quart. 16 (1969) 121\u2013137.","journal-title":"Naval Res. Log. Quart."},{"key":"BF02096258_CR76","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1287\/opre.21.1.247","volume":"21","author":"T.H. Mattheiss","year":"1973","unstructured":"T.H. Mattheiss, An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities, Oper. Res. 21 (1973) 247\u2013260.","journal-title":"Oper. Res."},{"key":"BF02096258_CR77","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1287\/moor.5.2.167","volume":"5","author":"T.H. Mattheiss","year":"1980","unstructured":"T.H. Mattheiss and D.S. Rubin, A survey and comparison of methods for finding all vertices of convex polyhedral sets, Math. Oper. Res. 5 (1980) 167\u2013185.","journal-title":"Math. Oper. Res."},{"key":"BF02096258_CR78","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF01580886","volume":"35","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo, A note on degeneracy in linear programming, Math. Progr. 35 (1986) 365\u2013367.","journal-title":"Math. Progr."},{"key":"BF02096258_CR79","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01609041","volume":"15","author":"P.G. McKeown","year":"1978","unstructured":"P.G. McKeown, Some computational results of using the Ahrens-Finke method for handling degeneracy in fixed charge transportation problems, Math. Progr. 15 (1978) 355\u2013359.","journal-title":"Math. Progr."},{"key":"BF02096258_CR80","unstructured":"J. Mrazek, Zu speziellen Eigenschaften von Knoten eines positiven Entartungsgraphen, Working Paper No. 180, FB Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1991)."},{"key":"BF02096258_CR81","doi-asserted-by":"crossref","unstructured":"P. Nash,Algebraic Fundamentals of Linear Programming, Lecture Notes in Economics and Mathematical Systems No. 259 (Springer, 1985) pp. 37\u201352.","DOI":"10.1007\/978-3-642-46564-2_4"},{"key":"BF02096258_CR82","unstructured":"M. Niggemeier, Entartungserscheinungen bei ganzzahligen Optimierungsproblemen \u2014 Eine \u00dcbersicht, Diplomarbeit, Fachbereich Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1989)."},{"key":"BF02096258_CR83","unstructured":"M. Niggemeier, Degeneracy in integer linear programming problems \u2014 A survey, Ann. Oper. Res. (1993), this volume."},{"key":"BF02096258_CR84","unstructured":"H.-J. Ollmert, Zur Theorie des Simplexverfahrens im ausgearteten Fall, Diplomarbeit, Fachbereich Wirtschaftswissenschaften, Universit\u00e4t Saarbr\u00fccken (1965)."},{"key":"BF02096258_CR85","unstructured":"H.-J. Ollmert, Kreisende lineare Programme, in:Operations Research Verfahren VI, eds. R. Henn, H.P. K\u00fcnzi and H. Schubert (Anton Hain, 1969)."},{"key":"BF02096258_CR86","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01721801","volume":"12","author":"P.-Q. Pan","year":"1990","unstructured":"P.-Q. Pan, Practical finite pivoting rules for the simplex method, OR Spektrum 12 (1990) 219\u2013225.","journal-title":"OR Spektrum"},{"key":"BF02096258_CR87","unstructured":"C. van de Panne,Methods for Linear and Quadratic Programming (North-Holland, 1975)."},{"key":"BF02096258_CR88","unstructured":"G. Piehler, Optimalbasenansatz zur Sensitivit\u00e4tsanalyse bei linearer Programmierung unter Entartung, Working Paper No. 130, Fachbereich Wirtschaftswissenschaft, FernUniversit\u00e4t Hagen (1988)."},{"key":"BF02096258_CR89","doi-asserted-by":"crossref","unstructured":"G. Piehler, Postoptimale Analyse f\u00fcr entartete lineare Optimierungsprobleme,Operations Research Proc. 1989, eds. K.-P. Kistner et al. (Springer, 1990) pp. 521\u2013528.","DOI":"10.1007\/978-3-642-75639-9_102"},{"key":"BF02096258_CR90","doi-asserted-by":"crossref","unstructured":"G. Piehler and H.-J. Kruse, Optimumgraphen zur Analyse linearer Optimierungsprobleme unter Entartung,Operations Research Proc. 1988, eds. D. Pressmar et al. (Springer, 1989) pp. 205\u2013210.","DOI":"10.1007\/978-3-642-74862-2_56"},{"key":"BF02096258_CR91","first-page":"83","volume":"12","author":"L.G. Proll","year":"1987","unstructured":"L.G. Proll, Goal aggregation via shadow prices \u2014 some counterexamples, Large Scale Syst. 12 (1987) 83\u201385.","journal-title":"Large Scale Syst."},{"key":"BF02096258_CR92","first-page":"67","volume":"16","author":"C. Roos","year":"1984","unstructured":"C. Roos, The umbrella approach to linear programming, Proc. Math. Opt. 16 (1984) 67\u201379.","journal-title":"Proc. Math. Opt."},{"key":"BF02096258_CR93","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01580776","volume":"41","author":"D.M. Ryan","year":"1988","unstructured":"D.M. Ryan and M.R. Osborne, On the solution of highly degenerate linear programmes, Math. Progr. 41 (1988) 385\u2013392.","journal-title":"Math. Progr."},{"key":"BF02096258_CR94","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0305-0548(86)90034-1","volume":"13","author":"H.D. Sherali","year":"1986","unstructured":"H.D. Sherali and S.E. Dickey, An extreme-point-ranking algorithm for the extreme point mathematical programming problem, Comp. Oper. Res. 13 (1986) 465\u2013475.","journal-title":"Comp. Oper. Res."},{"key":"BF02096258_CR95","unstructured":"D. Solow,Linear Programming. An Introduction to Finite Improvement Algorithms (Elsevier, 1984)."},{"key":"BF02096258_CR96","doi-asserted-by":"publisher","first-page":"160","DOI":"10.2307\/2490273","volume":"7","author":"J.E. Strum","year":"1969","unstructured":"J.E. Strum, Note on two-sided shadow prices, J. Account. Res. 7 (1969) 160\u2013162.","journal-title":"J. Account. Res."},{"key":"BF02096258_CR97","first-page":"8","volume":"2","author":"J. Telgen","year":"1980","unstructured":"J. Telgen, A note on a linear programming problem that cycled, COAL Newsletter 2 (1980) 8\u201311.","journal-title":"COAL Newsletter"},{"key":"BF02096258_CR98","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/mnsc.12.7.588","volume":"23","author":"G.L. Thompson","year":"1966","unstructured":"G.L. Thompson, F.M. Tonge and S. Zionts, Techniques for removing nonbinding constraints and extraneous variables from linear programming problems, Manag. Sci. 23 (1966) 588\u2013608.","journal-title":"Manag. Sci."},{"key":"BF02096258_CR99","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1287\/moor.16.4.671","volume":"16","author":"M. Todd","year":"1991","unstructured":"M. Todd, Probabilistic models for linear programming, Math. Oper. Res. 16 (1991) 671\u2013693.","journal-title":"Math. Oper. Res."},{"key":"BF02096258_CR100","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/BF01935004","volume":"25","author":"S.W. Wallace","year":"1985","unstructured":"S.W. Wallace, Pivoting rules and redundancy schemes in extreme point enumeration, BIT 25 (1985) 274\u2013280.","journal-title":"BIT"},{"key":"BF02096258_CR101","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1137\/0111006","volume":"11","author":"A.C. Williams","year":"1963","unstructured":"A.C. Williams, Marginal values in linear programming, J. Soc. Ind. Appl. Math. 11 (1963) 82\u201394.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"BF02096258_CR102","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1137\/0111016","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, A technique for resolving degeneracy in linear programming, J. Soc. Ind. Appl. Math. 11 (1963) 305\u2013311.","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"BF02096258_CR103","doi-asserted-by":"publisher","first-page":"222","DOI":"10.2307\/2490237","volume":"6","author":"F.K. Wright","year":"1968","unstructured":"F.K. Wright, Measuring asset services: a linear programming approach, J. Account. Res. 6 (1968) 222\u2013236.","journal-title":"J. Account. Res."},{"key":"BF02096258_CR104","first-page":"221","volume":"45","author":"H.-J. Zimmermann","year":"1975","unstructured":"H.-J. Zimmermann and T. Gal, Redundanz und ihre Bedeutung f\u00fcr betriebliche Optimierungsentscheidungen, Z. f\u00fcr Betriebswirtschaft 45 (1975) 221\u2013236.","journal-title":"Z. f\u00fcr Betriebswirtschaft"},{"key":"BF02096258_CR105","doi-asserted-by":"crossref","unstructured":"P. Z\u00f6rnig,Degeneracy Graphs and Simplex Cycling, Lecture Notes in Economics and Mathematical Systems No. 357 (Springer, 1991).","DOI":"10.1007\/978-3-642-45702-9"},{"key":"BF02096258_CR106","doi-asserted-by":"crossref","unstructured":"P. Z\u00f6rnig, A general theory of degeneracy graphs, Ann. Oper. Res. (1993), this volume.","DOI":"10.1007\/BF02023113"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096258.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF02096258\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096258","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02096258.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:14:34Z","timestamp":1652487274000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF02096258"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":106,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF02096258"],"URL":"https:\/\/doi.org\/10.1007\/bf02096258","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}