{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:02:08Z","timestamp":1761894128762},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1988,5,1]],"date-time":"1988-05-01T00:00:00Z","timestamp":578448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1988,5]]},"DOI":"10.1007\/bf01580776","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:50Z","timestamp":1114681970000},"page":"385-392","source":"Crossref","is-referenced-by-count":55,"title":["On the solution of highly degenerate linear programmes"],"prefix":"10.1007","volume":"41","author":[{"given":"D. M.","family":"Ryan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. R.","family":"Osborne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","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, \u201cNew finite pivoting rules for the simplex method,\u201dMathematics of Operations Research 2 (1977) 103\u2013107.","journal-title":"Mathematics of Operations Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"160","DOI":"10.2307\/1907845","volume":"20","author":"A. Charnes","year":"1952","unstructured":"A. Charnes, \u201cOptimality and degeneracy in linear programming,\u201dEconometrica 20 (1952) 160\u2013170.","journal-title":"Econometrica"},{"key":"CR3","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, G.B. Orden and P. Wolfe, \u201cThe generalized simplex method for minimizing a linear form under linear inequality restraints,\u201dPacific Journal of Mathematics 5 (1955) 183\u2013195.","journal-title":"Pacific Journal of Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"W.H. Cunningham, \u201cTheoretical properties of the network simplex method,\u201dMathematics of Operations Research 4 (1979) 196\u2013208.","journal-title":"Mathematics of Operations Research"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BFb0120710","volume":"4","author":"Paula M.J. Harris","year":"1975","unstructured":"Paula M.J. Harris, \u201cPivot selection methods of the DEVEX LP code,\u201dMathematical Programming Study 4 (1975) 30\u201357.","journal-title":"Mathematical Programming Study"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/B978-0-12-587260-7.50006-6","volume-title":"Mathematical Software III","author":"M.J. Hopper","year":"1977","unstructured":"M.J. Hopper and M.J.D. Powell, \u201cA technique that gains speed and accuracy in the minimax solution of overdetermined linear equations,\u201d in: J.R. Rice, ed.,Mathematical Software III (Academic Press, New York, 1977), 15\u201334."},{"key":"CR7","volume-title":"Finite algorithms in Optimization and Data Analysis","author":"M.R. Osborne","year":"1985","unstructured":"M.R. Osborne,Finite algorithms in Optimization and Data Analysis (Wiley, Chichester, 1985)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01581646","volume":"19","author":"A.F. Perold","year":"1980","unstructured":"A.F. Perold, \u201cA degeneracy exploiting LU factorization for the simplex method,\u201dMathematical Programming 19 (1980) 239\u2013254.","journal-title":"Mathematical Programming"},{"key":"CR9","volume-title":"\u201cFortran subroutines for handling sparse linear programming bases,\u201d Report AERE-R8269","author":"J.K. Reid","year":"1976","unstructured":"J.K. Reid, \u201cFortran subroutines for handling sparse linear programming bases,\u201d Report AERE-R8269, Atomic Energy Research Establishment, Harwell (1976)."},{"key":"CR10","unstructured":"D.M. Ryan and K.M. Garner, \u201cThe solution of aircrew scheduling problems for Air New Zealand,\u201d in:Proceedings of 21st Annual Conference of the Operational Research Society of New Zealand, Wellington (1985)."},{"key":"CR11","first-page":"205","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, \u201cA technique for resolving degeneracy in linear programming,\u201dSIAM Journal 11 (1963) 205\u2013211.","journal-title":"SIAM Journal"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580776.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580776\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:11Z","timestamp":1556896331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF01580776"],"URL":"https:\/\/doi.org\/10.1007\/bf01580776","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}