{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:02Z","timestamp":1752378002353,"version":"3.41.2"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1023\/a:1008651227485","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"221-237","source":"Crossref","is-referenced-by-count":2,"title":["Nondegeneracy of Polyhedra and Linear Programs"],"prefix":"10.1007","volume":"7","author":[{"given":"Yanhui","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato D.C.","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"122497_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01758841","volume":"8","author":"I. Adler","year":"1992","unstructured":"I. Adler and R.D.C. Monteiro, \"A geometric view of parametric linear programming,\" Algorithmica, vol. 8, pp. 161\u2013176, 1992.","journal-title":"Algorithmica"},{"key":"122497_CR2","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 programming,\" Journal of Operations Research Society, vol. 35. pp. 425\u2013431, 1984.","journal-title":"Journal of Operations Research Society"},{"key":"122497_CR3","first-page":"557","volume":"33","author":"D.C. Aucamp","year":"1982","unstructured":"D.C. Aucamp and D.I. Steinberg, \"The computation of shadow prices in linear programming,\" Journal of Operations Research, vol. 33. pp. 557\u2013565, 1982.","journal-title":"Journal of Operations Research"},{"key":"122497_CR4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, \"A varaution on Karmarkar's algorithm for solving linear programming problems,\" Mathematical Programming, vol. 36. pp. 174\u2013182, 1986.","journal-title":"Mathematical Programming"},{"key":"122497_CR5","doi-asserted-by":"crossref","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,\" Navel Research Logistics Quarterly, vol. 2. pp. 269\u2013276, 1955.","journal-title":"Navel Research Logistics Quarterly"},{"key":"122497_CR6","doi-asserted-by":"crossref","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 algorithm,\" Mathematics of Operations Research, vol. 2. pp. 103\u2013107, 1977.","journal-title":"Mathematics of Operations Research"},{"key":"122497_CR7","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, vol. 20. pp. 160\u2013170, April 1952.","journal-title":"Econometrica"},{"key":"122497_CR8","volume-title":"Linear Programming and Extensions","author":"G. Dantzig","year":"1963","unstructured":"G. Dantzig, Linear Programming and Extensions, Princeton University Press: Princeton, NJ, 1963."},{"key":"122497_CR9","first-page":"747","volume":"174","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \"Iterative solution of problems of linear and quadratic programming,\" Doklady Akademii Nauk SSSR, vol. 174. pp. 747\u2013748, 1967. Translated in: Soviet Mathematics Doklady, vol. 8. pp. 674-675, 1967.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"122497_CR10","volume-title":"Postoptimal Analysis, Parametric Programming and Related Topics","author":"T. Gal","year":"1979","unstructured":"T. Gal, Postoptimal Analysis, Parametric Programming and Related Topics, McGraw-Hill: New York, 1979."},{"key":"122497_CR11","doi-asserted-by":"crossref","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, state-of-the-artsurvey,\" OR Spektrum, vol. 8. pp. 59\u201371, 1986.","journal-title":"OR Spektrum"},{"key":"122497_CR12","doi-asserted-by":"crossref","unstructured":"H.J. Greenberg, \"An analysis of degeneracy,\" Naval Research Logistics Quarterly. pp. 635\u2013655, 1986.","DOI":"10.1002\/nav.3800330409"},{"key":"122497_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02096259","volume":"46","author":"O. G\u00fcler","year":"1993","unstructured":"O. G\u00fcler, D. Den Hertog, C. Roos, T. Terlaky, and T. Tsuchiya, \"Degeneracy in interior point methods for linear programming: A survey,\" Annals of Operations Research, vol. 46. pp. 107\u2013138, 1993.","journal-title":"Annals of Operations Research"},{"key":"122497_CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-6377(93)90040-N","volume":"13","author":"L.A. Hall","year":"1993","unstructured":"L.A. Hall and R.J. Vanderbei, \"Two-thirds is sharp for affine scaling,\" Operations Research Letters, vol. 13, pp. 197\u2013201, 1993.","journal-title":"Operations Research Letters"},{"key":"122497_CR15","series-title":"Tech. Report","volume-title":"Cycling in the simplex algorithm","author":"A.J. Hoffman","year":"1953","unstructured":"A.J. Hoffman, \"Cycling in the simplex algorithm,\" Tech. Report 2974, National Bureau of Standards Report, Washington, D.C., Dec. 1953."},{"key":"122497_CR16","doi-asserted-by":"crossref","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-cylcing pivoting rules,\" Mathematical Programming, vol. 41. pp. 317\u2013325, 1988.","journal-title":"Mathematical Programming"},{"key":"122497_CR17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF01580886","volume":"35","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo, \"A note on degeneracy in linear programming,\" Mathematical Programming, vol. 35. pp. 365\u2013367, 1986.","journal-title":"Mathematical Programming"},{"key":"122497_CR18","first-page":"65","volume":"47","author":"R.D.C. Monteiro","year":"1996","unstructured":"R.D.C. Monteiro and S. Mehrotra, \"A general parametric analysis approach and its implication to sensitivity analysis in interior point methods,\" Mathematical Programming, vol. 47. pp. 65\u201382, 1996.","journal-title":"Mathematical Programming"},{"key":"122497_CR19","series-title":"Technical Report","volume-title":"Global convergence of the affine scaling algorithm for convex quadratic programming","author":"R.D.C. Monteiro","year":"1995","unstructured":"R.D.C. Monteiro and T. Tsuchiya, \"Global convergence of the affine scaling algorithm for convex quadratic programming,\" Technical Report, School of Industraul Systems Engineering, Georgau Institute of Technology, Atlanta, GA 30332, USA, March 1995."},{"key":"122497_CR20","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF02023109","volume":"47","author":"R.D.C. Monteiro","year":"1993","unstructured":"R.D.C. Monteiro, T. Tsuchiya, and Y. Wang, \"A simplified global convergence proof of the affine scaling algorithm,\" Annals of Operations Research, vol. 47. pp. 443\u2013482, 1993.","journal-title":"Annals of Operations Research"},{"key":"122497_CR21","unstructured":"K.G. Murty, Linear Programming, John Wiley & Sons, 1983."},{"key":"122497_CR22","doi-asserted-by":"crossref","unstructured":"G. Nemhauser and L. Wolsey, Integer and Combinatoraul Optimization, John Wiley & Sons, 1988.","DOI":"10.1002\/9781118627372"},{"key":"122497_CR23","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1988","unstructured":"A. Schrijver, Theory of Linear and Integer Programming,John Wiley & Sons, New York, 1988."},{"key":"122497_CR24","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01582896","volume":"52","author":"T. Tsuchiya","year":"1991","unstructured":"T. Tsuchiya, \"Global convergence of the affine-scaling methods for degenerate linear programming problems,\" Mathematical Programming, vol. 52. pp. 377\u2013404, 1991.","journal-title":"Mathematical Programming"},{"key":"122497_CR25","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.17.3.527","volume":"17","author":"T. Tsuchiya","year":"1992","unstructured":"T. Tsuchiya, \"Global convergence property of the affine scaling method for primal degenerate linear programming problems,\" Mathematics of Operations Research, vol. 17. pp. 527\u2013557, 1992.","journal-title":"Mathematics of Operations Research"},{"key":"122497_CR26","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0805027","volume":"5","author":"T. Tsuchiya","year":"1995","unstructured":"T. Tsuchiya and M. Muramatsu, \"Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems,\" SAUM Journal on Optimization, vol. 5. pp. 525\u2013551, 1995.","journal-title":"SAUM Journal on Optimization"},{"key":"122497_CR27","first-page":"109","volume-title":"I.I. Dikin's convergence result for the affine-scaling algorithm","author":"R.J. Vanderbei","year":"1990","unstructured":"R.J. Vanderbei and J.C. Lagaraus, \"I.I. Dikin's convergence result for the affine-scaling algorithm,\" in Mathematical Development Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maune, USA, June\/July 1988, J.C. Lagaraus and M.J. Todd (eds.) of Contemporary Mathematics, American Mathematical Society: Providence, Rhode Island, USA, vol. 114. pp. 109\u2013119, 1990."},{"key":"122497_CR28","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon, and B.A. Freedman, \"A modification of Karmarkar's linear programming algorithm,\" Algorithmica, vol. 1. pp. 395\u2013407, 1986.","journal-title":"Algorithmica"},{"key":"122497_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02055188","volume":"27","author":"J.E. Ward","year":"1990","unstructured":"J.E. Ward and R.E. Wendell, \"Approaches to sensitivity analysis in linear programming,\" Annals of Operations Research, vol. 27. pp. 3\u201338, 1990.","journal-title":"Annals of Operations Research"},{"key":"122497_CR30","first-page":"82","volume":"11","author":"A.C. Willaums","year":"1963","unstructured":"A.C. Willaums, \"Marginal values in linear programming,\" Journal of SAUM, vol. 11. pp. 82\u201394, 1963.","journal-title":"Journal of SAUM"},{"key":"122497_CR31","doi-asserted-by":"crossref","unstructured":"P. Wolfe, \"Atechnique for resolving degeneracy in linear programming,\" Journal of SAUM, vol. 11, 1963.","DOI":"10.1137\/0111016"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008651227485.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008651227485\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008651227485.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:03:43Z","timestamp":1752375823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008651227485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,3]]}},"alternative-id":["122497"],"URL":"https:\/\/doi.org\/10.1023\/a:1008651227485","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}