{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T20:00:08Z","timestamp":1697832008721},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"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":[[1983,6]]},"DOI":"10.1007\/bf02592053","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:33:09Z","timestamp":1175182389000},"page":"172-181","source":"Crossref","is-referenced-by-count":5,"title":["Randomly generated polytopes for testing mathematical programming algorithms"],"prefix":"10.1007","volume":"26","author":[{"given":"W. B.","family":"van Dam","sequence":"first","affiliation":[]},{"given":"J. B. G.","family":"Frenk","sequence":"additional","affiliation":[]},{"given":"J.","family":"Telgen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02592053_CR1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon","year":"1954","unstructured":"S. Agmon, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"BF02592053_CR2","volume-title":"An introduction to multivariate statistical analysis","author":"T.W. Anderson","year":"1958","unstructured":"T.W. Anderson,An introduction to multivariate statistical analysis (Wiley, New York, 1958)."},{"key":"BF02592053_CR3","volume-title":"Mathematical Analysis","author":"T.M. Apostol","year":"1960","unstructured":"T.M. Apostol,Mathematical Analysis (Addison-Wesley, London, 1960)."},{"key":"BF02592053_CR4","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/BFb0121192","volume":"8","author":"D. Avis","year":"1978","unstructured":"D. Avis and V. Chvatal, \u201cNotes on Bland's pivoting rule\u201d,Mathematical Programming Study 8 (1978) 24\u201334.","journal-title":"Mathematical Programming Study"},{"key":"BF02592053_CR5","volume-title":"Probability and measure","author":"P. Billingsley","year":"1979","unstructured":"P. Billingsley,Probability and measure (Wiley, New York, 1979)."},{"key":"BF02592053_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1214\/aoms\/1177699073","volume":"38","author":"T.M. Cover","year":"1967","unstructured":"T.M. Cover and B. Efron, \u201cGeometrical probability and random points on a hypersphere\u201d,Annals of Mathematical Statistics 38 (1967) 213\u2013220.","journal-title":"Annals of Mathematical Statistics"},{"key":"BF02592053_CR7","series-title":"Report 7828","volume-title":"Some computational experiments with a primal-dual surrogate simplex method","author":"W.B. Dam van","year":"1978","unstructured":"W.B. van Dam and J. Telgen, \u201cSome computational experiments with a primal-dual surrogate simplex method\u201d, Report 7828 Econometric Institute, Erasmus University (Rotterdam, 1978)."},{"key":"BF02592053_CR8","unstructured":"R.S. Dembo and J.M. Mulvey, \u201cOn the analyais and comparison of mathematical programming techniques,Proceedings of the bicentennial conference on mathematical programming (Gaithersburg, MD, 1976)."},{"key":"BF02592053_CR9","series-title":"Working Paper 22","volume-title":"A primal-dual surrogate simplex algorithm","author":"R.S. Garfinkel","year":"1975","unstructured":"R.S. Garfinkel and P.L. Yu, \u201cA primal-dual surrogate simplex algorithm\u201d, Working Paper 22, College of Business Administration, University of Tennessee (Knoxvill, TN, 1975)."},{"key":"BF02592053_CR10","series-title":"Working Paper","volume-title":"Size reduction of linear programs with special structure","author":"S. Holm","year":"1975","unstructured":"S. Holm and D. Klein, \u201cSize reduction of linear programs with special structure\u201d, Working Paper, Odense University (Odense, Denmark, 1975)."},{"key":"BF02592053_CR11","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1287\/inte.2.1.8","volume":"2","author":"J.P. Ignizio","year":"1971","unstructured":"J.P. Ignizio, \u201cOn the establishment of standards for comparing algorithm performance\u201d,Interfaces 2 (1971) 8\u201311.","journal-title":"Interfaces"},{"key":"BF02592053_CR12","unstructured":"R.H. Jackson and J.M. Mulvey, \u201cA critical review of methods for comparing mathematical programming algorithms and software 1951\u20131977\u201d, presented at TIMS XXIII. (Athens, 1977)."},{"key":"BF02592053_CR13","volume-title":"Redundancy in mathematical programming","author":"M.H. Karwan","year":"1982","unstructured":"M.H. Karwan, J. Telgen and S. Zionts,Redundancy in mathematical programming (Springer-Verlag, New York, Heidelberg, 1982)."},{"key":"BF02592053_CR14","first-page":"191","volume":"20","author":"L.G. Khachian","year":"1979","unstructured":"L.G. Khachian, \u201cA polynomial algorithm in linear programming\u201d,Soviet Mathematics Doklady 20 (1979) 191\u2013194.","journal-title":"Soviet Mathematics Doklady"},{"key":"BF02592053_CR15","first-page":"264","volume":"23","author":"T.M. Liebling","year":"1972","unstructured":"T.M. Liebling, \u201cOn the number of iterations of the simplex method\u201d,Operations Research Vefahren 23 (1972) 264\u2013284.","journal-title":"Operations Research Vefahren"},{"key":"BF02592053_CR16","series-title":"Working Paper","volume-title":"Definition and generation of random polyhedra","author":"J.H. May","year":"1980","unstructured":"J.H. May and R.L. Smith, \u201cDefinition and generation of random polyhedra\u201d, Working Paper 390, Graduate School of Business, University of Pittsburgh (Pittsburgh, PA, 1980)."},{"key":"BF02592053_CR17","series-title":"Technical Report","volume-title":"Random polytopes: their definition, generation and aggregate properties","author":"J.H. May","year":"1980","unstructured":"J.H. May and R.L. Smith, \u201cRandom polytopes: their definition, generation and aggregate properties\u201d, Technical Report 80-6, Department of Industrial and Operations Engineering, University of Michigan (Ann Arbor, MI, 1980)."},{"key":"BF02592053_CR18","volume-title":"User's guide for LPGENR","author":"W.M. Michaels","year":"1975","unstructured":"W.M. Michaels and R.P. O'Neill, \u201cUser's guide for LPGENR\u201d, Department of Computer Science, Louisiana State University (Baton Rouge, LA, 1975)."},{"key":"BF02592053_CR19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"T.S. Motzkin","year":"1954","unstructured":"T.S. Motzkin and I.J. Schoenberg, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 393\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"BF02592053_CR20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/opre.12.1.161","volume":"12","author":"R.E. Quandt","year":"1964","unstructured":"R.E. Quandt and H.W. Kuhn, \u201cOn upper bounds for the number of iterations in solving linear programs\u201d,Operations Research 12 (1964) 161\u2013165.","journal-title":"Operations Research"},{"key":"BF02592053_CR21","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/moor.2.3.292","volume":"2","author":"B.K. Schmidt","year":"1977","unstructured":"B.K. Schmidt and T.H. Mattheis, \u201cThe probability that a random polytope is bounded\u201d.Mathematics of Operations Research 2 (1977) 292\u2013296.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592053_CR22","volume-title":"Redundancy and linear programs","author":"J. Telgen","year":"1979","unstructured":"J. Telgen,Redundancy and linear programs (Mathematical Centre, Amsterdam, 1979)."},{"key":"BF02592053_CR23","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1287\/mnsc.19.4.406","volume":"19","author":"S. Zionts","year":"1972","unstructured":"S. Zionts, \u201cSome empirical tests of the criss-cross method\u201d,Management Science 19 (1972) 406\u2013410.","journal-title":"Management Science"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592053.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592053\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["BF02592053"],"URL":"https:\/\/doi.org\/10.1007\/bf02592053","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}