{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:29:42Z","timestamp":1787333382994,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1998,11]]},"abstract":"<jats:p>A new recursive method for resolving degeneracy in simplex-like methods for linear programming (LP) is described. The method provides a guarantee of termination, even in the presence of round-off errors, and is readily implemented. In contrast to a previous method of the author, this method works throughout in the primal space. One consequence is that the steepest-edge criterion can be used on all iterations and at all levels of recursion.<\/jats:p>\n                  <jats:p>It is also shown that the associated steepest-edge coefficients provide information from which the expected condition of the current LP basis can be calculated cheaply. This provides a more accurate indication of the actual condition of a system than is obtained from norm-based condition numbers. This idea also enables the condition of null space matrices to be estimated.<\/jats:p>","DOI":"10.1137\/s1052623494277470","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1038-1059","source":"Crossref","is-referenced-by-count":2,"title":["A New Degeneracy Method and Steepest-Edge--Based Conditioning for LP"],"prefix":"10.1137","volume":"8","author":[{"given":"Roger","family":"Fletcher","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","unstructured":"MichelBalinski, RalphGomory, A mutual primal\u2010dual simplex method, McGraw\u2010Hill, New York, 1963, 17\u20132629:1069"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"G. B. Dantzig,\n                      Linear Programming and Extensions\n                      , Princeton University Press, Princeton, NJ, 1963.","DOI":"10.7249\/R366"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/5.3.247"},{"key":"R4","volume-title":"Practical methods of optimization","author":"Fletcher R.","year":"1987"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90026-2"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02023102"},{"key":"R7","unstructured":"R.Fletcher, J.Hall, Towards reliable linear programming, Pitman Res. Notes Math. Ser., Vol. 228, Longman Sci. Tech., Harlow, 1990, 89\u20131041124456"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581089"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01593804"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"HarveyGreenberg, JamesKalan, An exact update for Harris\u2019 tread, North\u2010Holland, Amsterdam, 1975, 0\u20130, 26\u201329. Programming Studies, Vol. 452:12766","DOI":"10.1007\/BFb0120709"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90312-3"},{"key":"R12","unstructured":"J. H. Wilkinson,\n                      The Algebraic Eigenvalue Problem\n                      , Oxford University Press, Oxford, 1965."},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1137\/0111016"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623494277470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:55:22Z","timestamp":1787331322000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623494277470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["10.1137\/S1052623494277470"],"URL":"https:\/\/doi.org\/10.1137\/s1052623494277470","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}