{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T00:26:20Z","timestamp":1652487980429},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf02023098","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T10:28:34Z","timestamp":1123842514000},"page":"249-269","source":"Crossref","is-referenced-by-count":5,"title":["Bounds on the number of vertices of perturbed polyhedra"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Paul","family":"Armand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02023098_CR1","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF00941298","volume":"70","author":"P. Armand","year":"1991","unstructured":"P. Armand and C. Malivert, Determination of the efficient set in multiobjective linear programming, J. Optim. Theory Appl. 70 (1991) 467\u2013489.","journal-title":"J. Optim. Theory Appl."},{"key":"BF02023098_CR2","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/moor.11.3.451","volume":"11","author":"D. Barnette","year":"1986","unstructured":"D. Barnette, P. Kleinschmidt and C.W. Lee, An upper bound theorem for polytope pairs, Math. Oper. Res. 11 (1986) 451\u2013464.","journal-title":"Math. Oper. Res."},{"key":"BF02023098_CR3","doi-asserted-by":"crossref","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, SIAM J. Appl. Math. 9 (1961) 72\u201388.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02023098_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1148-8","volume-title":"An Introduction to Convex Polytopes","author":"A. Brondsted","year":"1983","unstructured":"A. Brondsted,An Introduction to Convex Polytopes (Springer, New York\/Heidelberg\/Berlin, 1983)."},{"key":"BF02023098_CR5","doi-asserted-by":"crossref","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":"BF02023098_CR6","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"BF02023098_CR7","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 algorithm for minimizing a linear form under linear inequality restraints (RAND Corporation Report, 1954) Pacific J. Math. 5 (1955) 183\u2013195.","journal-title":"Pacific J. Math."},{"key":"BF02023098_CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.8.3.381","volume":"8","author":"H.E. Dyer","year":"1983","unstructured":"H.E. Dyer, The complexity of vertex enumeration methods, Math. Oper. Res. 8 (1983) 381\u2013402.","journal-title":"Math. Oper. Res."},{"key":"BF02023098_CR9","volume-title":"Determination of all neighbors of a degenerate extreme point in polytopes","author":"T. Gal","year":"1978","unstructured":"T. Gal, Determination of all neighbors of a degenerate extreme point in polytopes, Discussion Paper 17b, Fern Universit\u00e4t Hagen, Germany (1978)."},{"key":"BF02023098_CR10","doi-asserted-by":"crossref","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":"BF02023098_CR11","volume-title":"Degeneracy graphs \u2014 Theory and application. A state-of-the-art survey","author":"T. Gal","year":"1989","unstructured":"T. Gal, Degeneracy graphs \u2014 Theory and application. A state-of-the-art survey, Diskussionsbeitrag 142, Fern Universit\u00e4t Hagen, Germany (1989)."},{"key":"BF02023098_CR12","first-page":"3","volume":"6","author":"T. Gal","year":"1990","unstructured":"T. Gal, Degeneracy problems in mathematical programming and degeneracy graphs, Orion 6 (1990) 3\u201336.","journal-title":"Orion"},{"key":"BF02023098_CR13","volume-title":"Weakly redundant constraints and their impact on postoptimal analyses in LP, Diskussionsbeitrag 151","author":"T. Gal","year":"1990","unstructured":"T. Gal, Weakly redundant constraints and their impact on postoptimal analyses in LP, Diskussionsbeitrag 151, Fern Universit\u00e4t Hagen, Germany (1990)."},{"key":"BF02023098_CR14","volume-title":"The use of the TNP-rule to solve various degeneracy problems","author":"T. Gal","year":"1990","unstructured":"T. Gal and F. Geue, The use of the TNP-rule to solve various degeneracy problems, Diskussionsbeitrag 149a, Fern Universit\u00e4t Hagen, Germany (1990)."},{"key":"BF02023098_CR15","doi-asserted-by":"crossref","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":"BF02023098_CR16","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1080\/00029890.1969.12000279","volume":"76","author":"D. Gale","year":"1969","unstructured":"D. Gale, How to solve linear inequalities, Amer. Math. Monthly 76 (1969) 589\u2013599.","journal-title":"Amer. Math. Monthly"},{"key":"BF02023098_CR17","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"B. Gr\u00fcnbaum,Convex Polytopes (Wiley, London\/New York\/Sidney, 1967)."},{"key":"BF02023098_CR18","volume-title":"Linear Programming","author":"G. Hadley","year":"1962","unstructured":"G. Hadley,Linear Programming (Addison-Wesley, MA, 1962)."},{"key":"BF02023098_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02392139","volume":"133","author":"V. Klee","year":"1974","unstructured":"V. Klee, Polytopes pairs and their relationship to linear programming, Acta Math. 133 (1974) 1\u201325.","journal-title":"Acta Math."},{"key":"BF02023098_CR20","series-title":"Lecture Notes in Economics and Mathematical Systems","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-49270-9","volume-title":"Degeneracy Graphs and the Neighbourhood Problem","author":"H.-J. Kruse","year":"1986","unstructured":"H.-J. Kruse,Degeneracy Graphs and the Neighbourhood Problem, Lecture Notes in Economics and Mathematical Systems 260 (Springer, Berlin, 1986)."},{"key":"BF02023098_CR21","doi-asserted-by":"crossref","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":"BF02023098_CR22","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF01588326","volume":"18","author":"T.H. Mattheiss","year":"1980","unstructured":"T.H. Mattheiss and B.K. Schmidt, Computational results on an algorithm for finding all vertices of a polytope, Math. Progr. 18 (1980) 308\u2013329.","journal-title":"Math. Progr."},{"key":"BF02023098_CR23","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BFb0121041","volume":"24","author":"K.G. Murty","year":"1985","unstructured":"K.G. Murty, Faces of a polyhedron, Math. Progr. Study 24 (1985) 30\u201342.","journal-title":"Math. Progr. Study"},{"key":"BF02023098_CR24","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01580776","volume":"41","author":"M.R. Osborne","year":"1988","unstructured":"M.R. Osborne and D.M. Ryan, On the solution of highly degenerate linear programmes, Math. Progr. 41 (1988) 385\u2013392.","journal-title":"Math. Progr."},{"key":"BF02023098_CR25","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton, NJ, 1972)."},{"key":"BF02023098_CR26","first-page":"205","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, A technique for resolving degeneracy in linear programming, SIAM J. 11 (1963) 205\u2013211.","journal-title":"SIAM J."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023098.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023098\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023098","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:57Z","timestamp":1557787197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023098"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02023098"],"URL":"https:\/\/doi.org\/10.1007\/bf02023098","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}