{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T11:06:16Z","timestamp":1751367976530},"reference-count":17,"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\/bf01580769","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:50Z","timestamp":1114681970000},"page":"281-315","source":"Crossref","is-referenced-by-count":39,"title":["A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracy"],"prefix":"10.1007","volume":"41","author":[{"given":"Robert","family":"Fourer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"17","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) pp. 17\u201326."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0024-3795(80)90227-X","volume":"29","author":"R.H. Bartels","year":"1980","unstructured":"R.H. Bartels, \u201cA penalty linear programming method using reduced-gradient basis-exchange techniques,\u201dLinear Algebra and Its Applications 29 (1980) 17\u201332.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR3","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":"CR4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1002\/nav.3800010408","volume":"1","author":"A. Charnes","year":"1954","unstructured":"A. Charnes and C.E. Lemke, \u201cMinimization of non-linear separable convex functionals,\u201dNaval Research Logistics Quarterly 1 (1954) 301\u2013312.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR5","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"V. Chvatal,Linear Programming (W.H. Freeman, New York, 1983)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1137\/0713016","volume":"13","author":"A.R. Conn","year":"1976","unstructured":"A.R. Conn, \u201cLinear programming via a nondifferentiable penalty function,\u201dSIAM Journal on Numerical Analysis 13 (1976) 145\u2013154.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR7","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":"CR8","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":"CR9","volume-title":"\u201cA simplex algorithm for piecewise-linear programming III: Computational analysis and applications,\u201d Technical Report 86-03","author":"R. Fourer","year":"1986","unstructured":"R. Fourer, \u201cA simplex algorithm for piecewise-linear programming III: Computational analysis and applications,\u201d Technical Report 86-03, Department of Industrial Engineering and Management Sciences, Northwestern University (Evanston, IL, 1986)."},{"key":"CR10","first-page":"863","volume":"1","author":"E.G. Gol'\u0161te\u00een","year":"1960","unstructured":"E.G. Gol'\u0161te\u00een, \u201cA certain class of nonlinear extremum problems,\u201dDoklady Akademii Nauk SSSR 133; translation inSoviet Mathematics 1 (1960) 863\u2013866.","journal-title":"Soviet Mathematics"},{"key":"CR11","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":"CR12","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"Luenberger, D.G.,Linear and Nonlinear Programming, 2nd edition (Addison-Wesley Publishing Company, Reading, MA, 1984).","edition":"2nd edition"},{"key":"CR13","first-page":"89","volume-title":"Recent Advances in Mathematical Programming","author":"C.E. Miller","year":"1963","unstructured":"C.E. Miller, \u201cThe simplex method for local separable programming,\u201d in: R.L. Graves and P. Wolfe, eds.,Recent Advances in Mathematical Programming (McGraw-Hill, New York, 1963) pp. 89\u2013100."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1145\/321450.321455","volume":"15","author":"A. Orden","year":"1968","unstructured":"A. Orden and V. Nalbandian, \u201cA bidirectional simplex algorithm,\u201dJournal of the Association for Computing Machinery 15 (1968) 221\u2013235.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR15","unstructured":"D.C. Rarick, \u201cPivot row selection in the WHIZARD LP code,\u201d Management Science Systems."},{"key":"CR16","volume-title":"Network Flows and Monotropic Optimization","author":"R.T. Rockafellar","year":"1984","unstructured":"R.T. Rockafellar,Network Flows and Monotropic Optimization (Wiley-Interscience, New York, 1984)."},{"key":"CR17","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\/BF01580769.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580769\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580769","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\/BF01580769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,5]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,5]]}},"alternative-id":["BF01580769"],"URL":"https:\/\/doi.org\/10.1007\/bf01580769","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,5]]}}}