{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:49:05Z","timestamp":1781077745257,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,8,1]],"date-time":"1989-08-01T00:00:00Z","timestamp":617932800000},"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":[[1989,8]]},"DOI":"10.1007\/bf01589114","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:22:34Z","timestamp":1114690954000},"page":"437-474","source":"Crossref","is-referenced-by-count":109,"title":["A practical anti-cycling procedure for linearly constrained optimization"],"prefix":"10.1007","volume":"45","author":[{"given":"Philip E.","family":"Gill","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walter","family":"Murray","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael A.","family":"Saunders","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Margaret H.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Recent Advances in Mathematical Programming","author":"M.L. Balinski","year":"1963","unstructured":"M.L. Balinski and R.E. Gomory, \u201cA mutual primal-dual simplex method,\u201d in: R.L. Graves and P. Wolfe, eds.,Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963)."},{"key":"CR2","first-page":"119","volume-title":"Integer and Nonlinear Programming","author":"E.M.L. Beale","year":"1970","unstructured":"E.M.L. Beale, \u201cAdvanced algorithmic features for general mathematical programming systems,\u201d in: J. Abadie, ed.,Integer and Nonlinear Programming (North-Holland, Amsterdam, 1970) pp. 119\u2013137."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/BF01584344","volume":"13","author":"M. Benichou","year":"1977","unstructured":"M. Benichou, J.M. Gauthier, G. Hentges and G. Ribi\u00e8re, \u201cThe efficient solution of large-scale linear programming problems\u2014some algorithmic techniques and computational results,\u201dMathematical Programming 13 (1977) 280\u2013322.","journal-title":"Mathematical Programming"},{"key":"CR4","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":"CR5","volume-title":"GAMS: A User's Guide","author":"A. Brooke","year":"1988","unstructured":"A. Brooke, D. Kendrick and A. Meeraus,GAMS: A User's Guide (The Scientific Press, Redwood City, CA, 1988)."},{"key":"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":"CR7","volume-title":"\u201cMaking progress during a stall in the simplex algorithm,\u201d Report SOL 88-5","author":"G.B. Dantzig","year":"1988","unstructured":"G.B. Dantzig, \u201cMaking progress during a stall in the simplex algorithm,\u201d Report SOL 88-5, Department of Operations Research, Stanford University (Stanford, CA, 1988)."},{"key":"CR8","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, \u201cThe generalized simplex method for minimizing a linear form under linear inequality constraints,\u201dPacific Journal of Mathematics 5 (1955) 183\u2013195.","journal-title":"Pacific Journal of Mathematics"},{"key":"CR9","volume-title":"Bus crew scheduling and the set partitioning model","author":"J.C. Falkner","year":"1988","unstructured":"J.C. Falkner, \u201cBus crew scheduling and the set partitioning model,\u201d Ph.D. thesis, Department of Theoretical and Applied Mechanics, University of Auckland (Auckland, New Zealand, 1988)."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"J.C. Falkner and D.M. Ryan, \u201cAspects of bus crew scheduling using a set partitioning model,\u201d Fourth International Workshop on Computer-Aided Scheduling of Public Transport (Hamburg, 1987).","DOI":"10.1007\/978-3-642-85966-3_9"},{"key":"CR11","volume-title":"Practical Methods of Optimization: Vol. 2: Constrained Optimization","author":"R. Fletcher","year":"1981","unstructured":"R. Fletcher,Practical Methods of Optimization: Vol. 2: Constrained Optimization (Wiley, Chichester and New York, 1981)."},{"key":"CR12","volume-title":"\u201cDegeneracy in the presence of round-off errors,\u201d Technical Report NA\/89","author":"R. Fletcher","year":"1985","unstructured":"R. Fletcher, \u201cDegeneracy in the presence of round-off errors,\u201d Technical Report NA\/89, Department of Mathematical Sciences, University of Dundee (Dundee, 1985)."},{"key":"CR13","first-page":"213","volume-title":"The State of the Art in Numerical Analysis","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher, \u201cRecent developments in linear and quadratic programming,\u201d in: A. Iserles and M.J.D. Powell, eds.,The State of the Art in Numerical Analysis (Oxford University Press, Oxford and New York, 1987) pp. 213\u2013243."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1093\/imamat\/14.2.159","volume":"14","author":"R. Fletcher","year":"1974","unstructured":"R. Fletcher and M.P. Jackson, \u201cMinimization of a quadratic function of many variables subject only to upper and lower bounds,\u201dJournal of the Institute of Mathematics and its Applications 14 (1974) 159\u2013174.","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/BF01582246","volume":"33","author":"R. Fourer","year":"1985","unstructured":"R. Fourer, \u201cA simplex algorithm for piecewise-linear programming I: derivation and proof,\u201dMathematical Programming 33 (1985) 204\u2013233.","journal-title":"Mathematical Programming"},{"key":"CR16","unstructured":"R. Fourer and D.M. Gay, private communication (1989)."},{"key":"CR17","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201dMathematical Programming Society COAL Newsletter 13 (1985) 10\u201312.","journal-title":"Mathematical Programming Society COAL Newsletter"},{"key":"CR18","volume-title":"\u201cUser's Guide for LSSOL (Version 1.0): a Fortran package for constrained linear least-squares and convex quadratic programming,\u201d Report SOL 86-1","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, S.J. Hammarling, W. Murray, M.A. Saunders and M.H. Wright, \u201cUser's Guide for LSSOL (Version 1.0): a Fortran package for constrained linear least-squares and convex quadratic programming,\u201d Report SOL 86-1, Department of Operations Research, Stanford Univesity (Stanford, CA, 1986)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF01588976","volume":"14","author":"P.E. Gill","year":"1978","unstructured":"P.E. Gill and W. Murray, \u201cNumerically stable methods for quadratic programming,\u201dMathematical Programming 14 (1978) 349\u2013372.","journal-title":"Mathematical Programming"},{"key":"CR20","volume-title":"\u201cUser's Guide for SOL\/QPSOL (revised),\u201d Report SOL 84-6","author":"P.E. Gill","year":"1984","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, \u201cUser's Guide for SOL\/QPSOL (revised),\u201d Report SOL 84-6, Department of Operations Research, Stanford University (Stanford, CA, 1984)."},{"key":"CR21","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H. Wright,Practical Optimization (Academic Press, London and New York, 1981)."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/nav.3800120102","volume":"12","author":"G.W. Graves","year":"1965","unstructured":"G.W. Graves, \u201cA complete constructive algorithm for the general mixed linear programming problem,\u201dNaval Research Logistics Quarterly 12 (1965) 1\u201334.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/978-94-009-9935-0_6","volume-title":"Design and Implementation of Optimization Software","author":"H.J. Greenberg","year":"1978","unstructured":"H.J. Greenberg, \u201cPivot selection tactics,\u201d in: H.J. Greenberg, ed.,Design and Implementation of Optimization Software (Sijthoff and Noordhoff, Alphen aan den Rijn, 1978) pp. 143\u2013174."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, \u201cPivot selection methods of the Devex LP code,\u201dMathematical Programming 5 (1973) 1\u201328. [Reprinted inMathematical Programming Study 4 (1975) 30-57.]","journal-title":"Mathematical Programming"},{"key":"CR25","doi-asserted-by":"crossref","DOI":"10.21236\/ADA198945","volume-title":"Dynamic pricing criteria in linear programming","author":"E.S. Klotz","year":"1988","unstructured":"E.S. Klotz,Dynamic pricing criteria in linear programming, Ph.D. thesis, Department of Operations Research, Stanford University (Stanford, CA, 1988)."},{"key":"CR26","first-page":"173","volume-title":"\u201cAn analysis of an available set of linear programming test problems,\u201d Report SOL 87-11","author":"I.J. Lustig","year":"1987","unstructured":"I.J. Lustig, \u201cAn analysis of an available set of linear programming test problems,\u201d Report SOL 87-11, Department of Operations Research, Stanford University (Stanford, CA, 1987). [See alsoComputers and Operations Research 16 (1989) 173\u2013184.]"},{"key":"CR27","doi-asserted-by":"crossref","DOI":"10.21236\/ADA138522","volume-title":"\u201cMINOS 5.0 User's Guide,\u201d Report SOL 83-20","author":"B.A. Murtagh","year":"1983","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMINOS 5.0 User's Guide,\u201d Report SOL 83-20, Department of Operations Research, Stanford University (Stanford, CA, 1983)."},{"key":"CR28","volume-title":"\u201cMINOS 5.1 User's Guide,\u201d Report SOL 83-20R","author":"B.A. Murtagh","year":"1987","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMINOS 5.1 User's Guide,\u201d Report SOL 83-20R, Department of Operations Research, Stanford University (Stanford, CA, 1987)."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/22721.22959","volume":"12","author":"J.L. Nazareth","year":"1986","unstructured":"J.L. Nazareth, \u201cImplementation aids for the optimization algorithms that solve sequences of linear programs,\u201dACM Transactions on Mathematical Software 12 (1986) 307\u2013323.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR30","volume-title":"Computer Solution of Linear Programs","author":"J.L. Nazareth","year":"1987","unstructured":"J.L. Nazareth,Computer Solution of Linear Programs (Oxford University Press, New York and Oxford, 1987)."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0121186","volume":"31","author":"W. Ogryczak","year":"1987","unstructured":"W. Ogryczak, \u201cOn practical stopping rules for the simplex method,\u201dMathematical Programming Study 31 (1987) 167\u2013174.","journal-title":"Mathematical Programming Study"},{"key":"CR32","volume-title":"Advanced Linear-Programming Computing Techniques","author":"W. Orchard-Hays","year":"1968","unstructured":"W. Orchard-Hays,Advanced Linear-Programming Computing Techniques (McGraw-Hill, New York, 1968)."},{"key":"CR33","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"J.M. Ortega and W.C. Rheinboldt,Iterative Solution of Nonlinear Equations in Several Variables (Academic Press, London and New York, 1970)."},{"key":"CR34","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, New York, 1985)."},{"key":"CR35","volume-title":"Network Flows and Monotropic Optimization","author":"R.T. Rockafellar","year":"1984","unstructured":"R.T. Rockafellar,Network Flows and Monotropic Optimization (Wiley, New York, 1984)."},{"key":"CR36","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01580776","volume":"41","author":"D.M. Ryan","year":"1988","unstructured":"D.M. Ryan and M.R. Osborne, \u201cOn the solution of highly degenerate linear programs,\u201dMathematical Programming 41 (1988) 385\u2013392.","journal-title":"Mathematical Programming"},{"key":"CR37","volume-title":"The Algebraic Eigenvalue Problem","author":"J.H. Wilkinson","year":"1965","unstructured":"J.H. Wilkinson,The Algebraic Eigenvalue Problem (The Clarendon Press, Oxford, 1965)."},{"key":"CR38","unstructured":"P. Wolfe, \u201cThe reduced-gradient method,\u201d unpublished manuscript, the RAND Corporation (1962)."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/0111016","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, \u201cA technique for resolving degeneracy in linear programming,\u201dSIAM Journal of Applied Mathematics 11 (1963) 205\u2013211.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"CR40","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/1007004","volume":"7","author":"P. Wolfe","year":"1965","unstructured":"P. Wolfe, \u201cThe composite simplex algorithm,\u201dSIAM Review 7 (1965) 42\u201354.","journal-title":"SIAM Review"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589114.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01589114\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01589114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,3]],"date-time":"2023-05-03T02:48:38Z","timestamp":1683082118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01589114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":40,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["BF01589114"],"URL":"https:\/\/doi.org\/10.1007\/bf01589114","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}