{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:14:20Z","timestamp":1770974060521,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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,1]]},"DOI":"10.1007\/bf01582281","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:32:42Z","timestamp":1114662762000},"page":"97-102","source":"Crossref","is-referenced-by-count":7,"title":["A new approach to the analysis of random methods for detecting necessary linear inequality constraints"],"prefix":"10.1007","volume":"43","author":[{"given":"Richard J.","family":"Caron","sequence":"first","affiliation":[]},{"given":"J. F.","family":"McDonald","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Handbook of Mathematical Functions","author":"M. Abramowitz","year":"1964","unstructured":"M. Abramowitz and I.A. Stegun, eds.,Handbook of Mathematical Functions (National Bureau of Standards, Washington, DC, 1964)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF02591694","volume":"37","author":"H.C.P. Berbee","year":"1987","unstructured":"H.C.P. Berbee, C.G.E. Boender, A.H.G. Rinooy Kan, C.L. Sheffer, R.L. Smith and T. Telgen, \u201cHit-and-run algorithms for the identification of nonredundant linear inequalities,\u201dMathematical Programming 37 (1987) 184\u2013207.","journal-title":"Mathematical Programming"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-642-45535-3_10","volume-title":"Redundancy in Mathematical Programming","author":"A. Boneh","year":"1983","unstructured":"A. Boneh, \u201cPreduce\u2014A probabilistic algorithm identifying redundancy by a random feasible point generator (RFPG),\u201d in: M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts, eds.,Redundancy in Mathematical Programming (Springer-Verlag, Berlin, 1983) pp. 108\u2013134."},{"key":"CR4","volume-title":"\u201cConstraints' redundancy and feasible region boundedness by random feasible point generator (RFPG), \u201ccontributed paper","author":"A. Boneh","year":"1979","unstructured":"A. Boneh and A. Golan, \u201cConstraints' redundancy and feasible region boundedness by random feasible point generator (RFPG), \u201ccontributed paper, Third European congress on operations research, EURO III (Amsterdam, The Netherlands, April 1979)."},{"key":"CR5","volume-title":"\u201cRandom methods for detecting necessary linear inequality constraints: Stopping Rules,\u201d Windsor Mathematics Report WMR 86-03","author":"R.J. Caron","year":"1986","unstructured":"R.J. Caron, J.F. McDonald, R.L. Smith and J. Telgen, \u201cRandom methods for detecting necessary linear inequality constraints: Stopping Rules,\u201d Windsor Mathematics Report WMR 86-03, Department of Mathematics and Statistics, University of Windsor (Windsor, Ontario, 1986)."},{"key":"CR6","volume-title":"An Introduction to Probability Theory and its Applications, Volume 1, Third Edition","author":"W. Feller","year":"1968","unstructured":"W. Feller,An Introduction to Probability Theory and its Applications, Volume 1, Third Edition (John Wiley and Sons, New York, NY, 1968)."},{"key":"CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-45535-3","volume-title":"Redundancy in Mathematical Programming","author":"M.H. Karwan","year":"1983","unstructured":"M.H. Karwan, V. Lotfi, J. Telgen and S. Zionts, eds.,Redundancy in Mathematical Programming (Springer-Verlag, Berlin, 1983)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1287\/opre.32.6.1296","volume":"32","author":"R.L. Smith","year":"1984","unstructured":"R.L. Smith, \u201cEfficient Monte Carlo procedures for generating points uniformly distributed over bounded regions,\u201dOperations Research 32 (1984) 1296\u20131308.","journal-title":"Operations Research"},{"key":"CR9","volume-title":"\u201cRandom methods for identifying nonredundant constraints,\u201d Technical Report No. 81-4","author":"R.L. Smith","year":"1981","unstructured":"R.L. Smith and J. Telgen, \u201cRandom methods for identifying nonredundant constraints,\u201d Technical Report No. 81-4, Department of Industrial and Operations Engineering, The University of Michigan (Ann Arbor, MI, 1981)."},{"key":"CR10","unstructured":"J. Telgen, private communication with A. Boneh (1980)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582281\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:15:48Z","timestamp":1556882148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":10,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["BF01582281"],"URL":"https:\/\/doi.org\/10.1007\/bf01582281","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}